/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 15:04:48,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 15:04:48,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 15:04:48,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 15:04:48,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 15:04:48,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 15:04:48,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 15:04:48,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 15:04:48,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 15:04:48,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 15:04:48,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 15:04:48,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 15:04:48,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 15:04:48,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 15:04:48,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 15:04:48,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 15:04:48,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 15:04:48,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 15:04:48,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 15:04:48,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 15:04:48,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 15:04:48,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 15:04:48,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 15:04:48,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 15:04:48,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 15:04:48,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 15:04:48,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 15:04:48,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 15:04:48,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 15:04:48,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 15:04:48,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 15:04:48,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 15:04:48,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 15:04:48,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 15:04:48,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 15:04:48,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 15:04:48,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 15:04:48,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 15:04:48,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 15:04:48,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 15:04:48,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 15:04:48,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 15:04:48,918 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 15:04:48,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 15:04:48,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 15:04:48,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 15:04:48,923 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 15:04:48,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 15:04:48,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 15:04:48,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 15:04:48,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 15:04:48,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 15:04:48,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 15:04:48,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 15:04:48,926 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 15:04:48,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 15:04:48,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 15:04:48,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 15:04:48,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 15:04:48,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:04:48,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 15:04:48,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 15:04:48,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 15:04:48,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 15:04:48,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 15:04:48,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 15:04:48,928 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 15:04:48,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 15:04:49,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 15:04:49,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 15:04:49,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 15:04:49,351 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 15:04:49,352 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 15:04:49,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2020-12-23 15:04:49,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/51d9f8d60/d1b23635566344f78e299b6a6cc0fd28/FLAG5182c218c [2020-12-23 15:04:50,410 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 15:04:50,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2020-12-23 15:04:50,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/51d9f8d60/d1b23635566344f78e299b6a6cc0fd28/FLAG5182c218c [2020-12-23 15:04:50,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/51d9f8d60/d1b23635566344f78e299b6a6cc0fd28 [2020-12-23 15:04:50,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 15:04:50,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 15:04:50,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 15:04:50,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 15:04:50,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 15:04:50,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:04:50" (1/1) ... [2020-12-23 15:04:50,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65641100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:50, skipping insertion in model container [2020-12-23 15:04:50,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:04:50" (1/1) ... [2020-12-23 15:04:50,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 15:04:50,977 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[489],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] [2020-12-23 15:04:52,044 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i[190557,190570] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~flags~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~flags~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~1,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~urb_context~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[189],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~interface~0,] left hand side expression in assignment: lhs: VariableLHS[~iface_desc~0,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~endpoint~0,] left hand side expression in assignment: lhs: VariableLHS[~urbcount~0,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[211],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[210],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[209],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[219],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[385],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[205],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb~0,] left hand side expression in assignment: lhs: VariableLHS[~usb_status~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2246],StructAccessExpression[IdentifierExpression[~ar_usb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~4,] left hand side expression in assignment: lhs: VariableLHS[~pipe~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~5,] left hand side expression in assignment: lhs: VariableLHS[~pipe~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~pipe~3,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~pipe~4,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~__constr_expr_0~0,],counter] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[221],StructAccessExpression[IdentifierExpression[~pipe~4,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[245],StructAccessExpression[IdentifierExpression[~pipe~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3228],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3236],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~2,] left hand side expression in assignment: lhs: VariableLHS[~__ms~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~__ms~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~device~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~device~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[197],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[84],StructAccessExpression[IdentifierExpression[~device~0,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[393],IdentifierExpression[~i~5,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~device~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe~5,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~6,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~urb~1,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~urb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~usb_status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~device~2,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~device~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~device~4,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~3,] left hand side expression in assignment: lhs: VariableLHS[~cmd~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~0,],base],StructAccessExpression[IdentifierExpression[~cmd~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cmd~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~resp_len~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~3,] left hand side expression in assignment: lhs: VariableLHS[~resp~0,] left hand side expression in assignment: address: IdentifierExpression[~data,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~4,] left hand side expression in assignment: lhs: VariableLHS[~cmd~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~4,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~5,] left hand side expression in assignment: lhs: VariableLHS[~ret~5,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~vendor_id~0,] left hand side expression in assignment: lhs: VariableLHS[~product_id~0,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~ar~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[121],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[117],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[45],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6882],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3244],StructAccessExpression[IdentifierExpression[~ar_usb~7,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~device~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~device~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~ret~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~ath6kl_usb_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ath6kl_usb_ops_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg19~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~set,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~set_impl~0,GLOBAL],[IdentifierExpression[~last_index~0,GLOBAL]]] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~set_impl~0,GLOBAL],[BinaryExpression[ARITHMINUS,IdentifierExpression[~i~7,],IntegerLiteral[1]]]] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~8,] left hand side expression in assignment: lhs: VariableLHS[~i~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: lhs: VariableLHS[~skb~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] [2020-12-23 15:04:52,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:04:52,672 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[489],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] [2020-12-23 15:04:52,906 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i[190557,190570] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~flags~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~flags~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~1,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~urb_context~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[189],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~interface~0,] left hand side expression in assignment: lhs: VariableLHS[~iface_desc~0,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~endpoint~0,] left hand side expression in assignment: address: IdentifierExpression[~#urbcount~0,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[211],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[210],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[209],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[219],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[385],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[205],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb~0,] left hand side expression in assignment: lhs: VariableLHS[~usb_status~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2246],StructAccessExpression[IdentifierExpression[~ar_usb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~4,] left hand side expression in assignment: lhs: VariableLHS[~pipe~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~5,] left hand side expression in assignment: lhs: VariableLHS[~pipe~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~pipe~3,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~pipe~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[221],StructAccessExpression[IdentifierExpression[~pipe~4,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[245],StructAccessExpression[IdentifierExpression[~pipe~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3228],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3236],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~2,] left hand side expression in assignment: lhs: VariableLHS[~__ms~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~__ms~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~device~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~device~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[197],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[84],StructAccessExpression[IdentifierExpression[~device~0,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[393],IdentifierExpression[~i~5,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~device~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe~5,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~6,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~urb~1,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~urb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~usb_status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~device~2,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~device~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~device~4,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~3,] left hand side expression in assignment: lhs: VariableLHS[~cmd~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~0,],base],StructAccessExpression[IdentifierExpression[~cmd~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cmd~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#resp_len~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~3,] left hand side expression in assignment: lhs: VariableLHS[~resp~0,] left hand side expression in assignment: address: IdentifierExpression[~data,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~4,] left hand side expression in assignment: lhs: VariableLHS[~cmd~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~4,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~5,] left hand side expression in assignment: lhs: VariableLHS[~ret~5,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~vendor_id~0,] left hand side expression in assignment: lhs: VariableLHS[~product_id~0,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~ar~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[121],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[117],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[45],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6882],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3244],StructAccessExpression[IdentifierExpression[~ar_usb~7,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~device~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~device~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~ret~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~ath6kl_usb_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ath6kl_usb_ops_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg19~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~set,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~last_index~0,GLOBAL]]]]] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMINUS,IdentifierExpression[~i~7,],IntegerLiteral[1]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~8,] left hand side expression in assignment: lhs: VariableLHS[~i~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: lhs: VariableLHS[~skb~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] [2020-12-23 15:04:53,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:04:53,307 INFO L208 MainTranslator]: Completed translation [2020-12-23 15:04:53,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53 WrapperNode [2020-12-23 15:04:53,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 15:04:53,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 15:04:53,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 15:04:53,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 15:04:53,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... [2020-12-23 15:04:53,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... [2020-12-23 15:04:53,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 15:04:53,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 15:04:53,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 15:04:53,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 15:04:53,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... [2020-12-23 15:04:53,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... [2020-12-23 15:04:53,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... [2020-12-23 15:04:53,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... [2020-12-23 15:04:53,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... [2020-12-23 15:04:54,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... [2020-12-23 15:04:54,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... [2020-12-23 15:04:54,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 15:04:54,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 15:04:54,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 15:04:54,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 15:04:54,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:04:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-12-23 15:04:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-12-23 15:04:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-23 15:04:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 15:04:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 15:04:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u16 [2020-12-23 15:04:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 15:04:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 15:04:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 15:04:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 15:04:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u32 [2020-12-23 15:04:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 15:04:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 15:04:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 15:04:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-12-23 15:04:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u8 [2020-12-23 15:04:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 15:04:54,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 15:05:05,684 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 15:05:05,685 INFO L299 CfgBuilder]: Removed 1424 assume(true) statements. [2020-12-23 15:05:05,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:05:05 BoogieIcfgContainer [2020-12-23 15:05:05,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 15:05:05,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 15:05:05,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 15:05:05,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 15:05:05,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:04:50" (1/3) ... [2020-12-23 15:05:05,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21dc1000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:05:05, skipping insertion in model container [2020-12-23 15:05:05,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:04:53" (2/3) ... [2020-12-23 15:05:05,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21dc1000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:05:05, skipping insertion in model container [2020-12-23 15:05:05,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:05:05" (3/3) ... [2020-12-23 15:05:05,698 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2020-12-23 15:05:05,705 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 15:05:05,711 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 15:05:05,730 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 15:05:05,765 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 15:05:05,765 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 15:05:05,765 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 15:05:05,765 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 15:05:05,766 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 15:05:05,766 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 15:05:05,766 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 15:05:05,766 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 15:05:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states. [2020-12-23 15:05:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 15:05:05,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:05,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:05,813 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1077921483, now seen corresponding path program 1 times [2020-12-23 15:05:05,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:05,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310288154] [2020-12-23 15:05:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 15:05:06,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310288154] [2020-12-23 15:05:06,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:06,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:05:06,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500192588] [2020-12-23 15:05:06,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:05:06,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:06,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:05:06,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:06,466 INFO L87 Difference]: Start difference. First operand 1211 states. Second operand 3 states. [2020-12-23 15:05:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:06,713 INFO L93 Difference]: Finished difference Result 2419 states and 3371 transitions. [2020-12-23 15:05:06,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:05:06,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-12-23 15:05:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:06,747 INFO L225 Difference]: With dead ends: 2419 [2020-12-23 15:05:06,748 INFO L226 Difference]: Without dead ends: 1205 [2020-12-23 15:05:06,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-12-23 15:05:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1205. [2020-12-23 15:05:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2020-12-23 15:05:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1602 transitions. [2020-12-23 15:05:06,877 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1602 transitions. Word has length 41 [2020-12-23 15:05:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:06,877 INFO L481 AbstractCegarLoop]: Abstraction has 1205 states and 1602 transitions. [2020-12-23 15:05:06,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:05:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1602 transitions. [2020-12-23 15:05:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-23 15:05:06,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:06,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:06,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 15:05:06,881 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:06,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:06,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1220483567, now seen corresponding path program 1 times [2020-12-23 15:05:06,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:06,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054343293] [2020-12-23 15:05:06,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 15:05:07,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054343293] [2020-12-23 15:05:07,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:07,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:05:07,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203409385] [2020-12-23 15:05:07,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:05:07,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:07,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:05:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:07,137 INFO L87 Difference]: Start difference. First operand 1205 states and 1602 transitions. Second operand 3 states. [2020-12-23 15:05:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:09,294 INFO L93 Difference]: Finished difference Result 3464 states and 4626 transitions. [2020-12-23 15:05:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:05:09,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-12-23 15:05:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:09,306 INFO L225 Difference]: With dead ends: 3464 [2020-12-23 15:05:09,307 INFO L226 Difference]: Without dead ends: 2323 [2020-12-23 15:05:09,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2020-12-23 15:05:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2323. [2020-12-23 15:05:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2020-12-23 15:05:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3098 transitions. [2020-12-23 15:05:09,376 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3098 transitions. Word has length 43 [2020-12-23 15:05:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:09,377 INFO L481 AbstractCegarLoop]: Abstraction has 2323 states and 3098 transitions. [2020-12-23 15:05:09,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:05:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3098 transitions. [2020-12-23 15:05:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 15:05:09,380 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:09,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:09,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 15:05:09,381 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:09,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:09,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1842814587, now seen corresponding path program 1 times [2020-12-23 15:05:09,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:09,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992403899] [2020-12-23 15:05:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 15:05:09,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992403899] [2020-12-23 15:05:09,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:09,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:05:09,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677927146] [2020-12-23 15:05:09,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:05:09,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:09,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:05:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:05:09,623 INFO L87 Difference]: Start difference. First operand 2323 states and 3098 transitions. Second operand 5 states. [2020-12-23 15:05:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:10,084 INFO L93 Difference]: Finished difference Result 6839 states and 9139 transitions. [2020-12-23 15:05:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:05:10,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-12-23 15:05:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:10,107 INFO L225 Difference]: With dead ends: 6839 [2020-12-23 15:05:10,107 INFO L226 Difference]: Without dead ends: 4575 [2020-12-23 15:05:10,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:05:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2020-12-23 15:05:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4535. [2020-12-23 15:05:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4535 states. [2020-12-23 15:05:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6050 transitions. [2020-12-23 15:05:10,387 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6050 transitions. Word has length 51 [2020-12-23 15:05:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:10,388 INFO L481 AbstractCegarLoop]: Abstraction has 4535 states and 6050 transitions. [2020-12-23 15:05:10,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:05:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6050 transitions. [2020-12-23 15:05:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 15:05:10,399 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:10,399 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:10,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 15:05:10,400 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash -683844340, now seen corresponding path program 1 times [2020-12-23 15:05:10,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:10,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352486865] [2020-12-23 15:05:10,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 15:05:10,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352486865] [2020-12-23 15:05:10,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:10,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:05:10,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072036793] [2020-12-23 15:05:10,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:05:10,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:10,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:05:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:10,626 INFO L87 Difference]: Start difference. First operand 4535 states and 6050 transitions. Second operand 3 states. [2020-12-23 15:05:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:11,074 INFO L93 Difference]: Finished difference Result 10801 states and 14385 transitions. [2020-12-23 15:05:11,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:05:11,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 15:05:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:11,112 INFO L225 Difference]: With dead ends: 10801 [2020-12-23 15:05:11,112 INFO L226 Difference]: Without dead ends: 6330 [2020-12-23 15:05:11,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6330 states. [2020-12-23 15:05:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6330 to 6323. [2020-12-23 15:05:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6323 states. [2020-12-23 15:05:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 8402 transitions. [2020-12-23 15:05:11,347 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 8402 transitions. Word has length 100 [2020-12-23 15:05:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:11,349 INFO L481 AbstractCegarLoop]: Abstraction has 6323 states and 8402 transitions. [2020-12-23 15:05:11,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:05:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 8402 transitions. [2020-12-23 15:05:11,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 15:05:11,362 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:11,362 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:11,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 15:05:11,363 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:11,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1867636703, now seen corresponding path program 1 times [2020-12-23 15:05:11,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:11,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867057430] [2020-12-23 15:05:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 15:05:11,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867057430] [2020-12-23 15:05:11,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:11,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:05:11,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190428276] [2020-12-23 15:05:11,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:05:11,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:05:11,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:11,581 INFO L87 Difference]: Start difference. First operand 6323 states and 8402 transitions. Second operand 3 states. [2020-12-23 15:05:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:11,912 INFO L93 Difference]: Finished difference Result 15376 states and 20514 transitions. [2020-12-23 15:05:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:05:11,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 15:05:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:11,959 INFO L225 Difference]: With dead ends: 15376 [2020-12-23 15:05:11,959 INFO L226 Difference]: Without dead ends: 9117 [2020-12-23 15:05:11,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9117 states. [2020-12-23 15:05:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9117 to 9103. [2020-12-23 15:05:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9103 states. [2020-12-23 15:05:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9103 states to 9103 states and 12168 transitions. [2020-12-23 15:05:12,430 INFO L78 Accepts]: Start accepts. Automaton has 9103 states and 12168 transitions. Word has length 104 [2020-12-23 15:05:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:12,431 INFO L481 AbstractCegarLoop]: Abstraction has 9103 states and 12168 transitions. [2020-12-23 15:05:12,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:05:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 9103 states and 12168 transitions. [2020-12-23 15:05:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 15:05:12,445 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:12,445 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:12,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 15:05:12,445 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:12,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1834598712, now seen corresponding path program 1 times [2020-12-23 15:05:12,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:12,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772050522] [2020-12-23 15:05:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 15:05:12,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772050522] [2020-12-23 15:05:12,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:12,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:05:12,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771972414] [2020-12-23 15:05:12,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:05:12,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:12,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:05:12,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:12,631 INFO L87 Difference]: Start difference. First operand 9103 states and 12168 transitions. Second operand 3 states. [2020-12-23 15:05:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:13,079 INFO L93 Difference]: Finished difference Result 22325 states and 29891 transitions. [2020-12-23 15:05:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:05:13,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2020-12-23 15:05:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:13,156 INFO L225 Difference]: With dead ends: 22325 [2020-12-23 15:05:13,156 INFO L226 Difference]: Without dead ends: 17762 [2020-12-23 15:05:13,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17762 states. [2020-12-23 15:05:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17762 to 9143. [2020-12-23 15:05:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2020-12-23 15:05:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 12208 transitions. [2020-12-23 15:05:13,768 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 12208 transitions. Word has length 110 [2020-12-23 15:05:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:13,776 INFO L481 AbstractCegarLoop]: Abstraction has 9143 states and 12208 transitions. [2020-12-23 15:05:13,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:05:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 12208 transitions. [2020-12-23 15:05:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 15:05:13,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:13,794 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:13,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 15:05:13,794 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash 227508482, now seen corresponding path program 1 times [2020-12-23 15:05:13,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:13,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067024808] [2020-12-23 15:05:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 15:05:14,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067024808] [2020-12-23 15:05:14,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:14,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:05:14,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335942137] [2020-12-23 15:05:14,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:05:14,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:14,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:05:14,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:05:14,041 INFO L87 Difference]: Start difference. First operand 9143 states and 12208 transitions. Second operand 4 states. [2020-12-23 15:05:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:15,659 INFO L93 Difference]: Finished difference Result 42869 states and 57332 transitions. [2020-12-23 15:05:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:05:15,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2020-12-23 15:05:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:15,743 INFO L225 Difference]: With dead ends: 42869 [2020-12-23 15:05:15,743 INFO L226 Difference]: Without dead ends: 33790 [2020-12-23 15:05:15,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:05:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33790 states. [2020-12-23 15:05:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33790 to 9223. [2020-12-23 15:05:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9223 states. [2020-12-23 15:05:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9223 states to 9223 states and 12288 transitions. [2020-12-23 15:05:16,457 INFO L78 Accepts]: Start accepts. Automaton has 9223 states and 12288 transitions. Word has length 111 [2020-12-23 15:05:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:16,457 INFO L481 AbstractCegarLoop]: Abstraction has 9223 states and 12288 transitions. [2020-12-23 15:05:16,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:05:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 9223 states and 12288 transitions. [2020-12-23 15:05:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 15:05:16,472 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:16,473 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:16,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 15:05:16,473 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash 796501591, now seen corresponding path program 1 times [2020-12-23 15:05:16,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:16,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721068624] [2020-12-23 15:05:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 15:05:16,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721068624] [2020-12-23 15:05:16,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:16,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:05:16,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098569585] [2020-12-23 15:05:16,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:05:16,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:16,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:05:16,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:05:16,757 INFO L87 Difference]: Start difference. First operand 9223 states and 12288 transitions. Second operand 4 states. [2020-12-23 15:05:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:19,818 INFO L93 Difference]: Finished difference Result 22598 states and 30118 transitions. [2020-12-23 15:05:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:05:19,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2020-12-23 15:05:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:19,851 INFO L225 Difference]: With dead ends: 22598 [2020-12-23 15:05:19,851 INFO L226 Difference]: Without dead ends: 13439 [2020-12-23 15:05:19,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:05:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13439 states. [2020-12-23 15:05:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13439 to 9163. [2020-12-23 15:05:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9163 states. [2020-12-23 15:05:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 12168 transitions. [2020-12-23 15:05:20,345 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 12168 transitions. Word has length 112 [2020-12-23 15:05:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:20,345 INFO L481 AbstractCegarLoop]: Abstraction has 9163 states and 12168 transitions. [2020-12-23 15:05:20,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:05:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 12168 transitions. [2020-12-23 15:05:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-23 15:05:20,363 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:20,363 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:20,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 15:05:20,363 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:20,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash 676703786, now seen corresponding path program 1 times [2020-12-23 15:05:20,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:20,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760187990] [2020-12-23 15:05:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 15:05:20,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760187990] [2020-12-23 15:05:20,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:20,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:05:20,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579772518] [2020-12-23 15:05:20,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:05:20,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:05:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:20,592 INFO L87 Difference]: Start difference. First operand 9163 states and 12168 transitions. Second operand 3 states. [2020-12-23 15:05:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:21,110 INFO L93 Difference]: Finished difference Result 18310 states and 24331 transitions. [2020-12-23 15:05:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:05:21,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2020-12-23 15:05:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:21,130 INFO L225 Difference]: With dead ends: 18310 [2020-12-23 15:05:21,130 INFO L226 Difference]: Without dead ends: 9211 [2020-12-23 15:05:21,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2020-12-23 15:05:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 9187. [2020-12-23 15:05:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9187 states. [2020-12-23 15:05:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9187 states to 9187 states and 12192 transitions. [2020-12-23 15:05:21,701 INFO L78 Accepts]: Start accepts. Automaton has 9187 states and 12192 transitions. Word has length 114 [2020-12-23 15:05:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:21,701 INFO L481 AbstractCegarLoop]: Abstraction has 9187 states and 12192 transitions. [2020-12-23 15:05:21,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:05:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 9187 states and 12192 transitions. [2020-12-23 15:05:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 15:05:21,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:21,717 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:21,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 15:05:21,718 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2142614062, now seen corresponding path program 1 times [2020-12-23 15:05:21,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:21,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104766824] [2020-12-23 15:05:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 15:05:21,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104766824] [2020-12-23 15:05:21,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877614586] [2020-12-23 15:05:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:05:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:22,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:05:22,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:05:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 15:05:22,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:05:22,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-12-23 15:05:22,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822258411] [2020-12-23 15:05:22,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:05:22,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:22,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:05:22,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:05:22,994 INFO L87 Difference]: Start difference. First operand 9187 states and 12192 transitions. Second operand 6 states. [2020-12-23 15:05:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:24,005 INFO L93 Difference]: Finished difference Result 18468 states and 24572 transitions. [2020-12-23 15:05:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:05:24,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2020-12-23 15:05:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:24,028 INFO L225 Difference]: With dead ends: 18468 [2020-12-23 15:05:24,028 INFO L226 Difference]: Without dead ends: 9341 [2020-12-23 15:05:24,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:05:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9341 states. [2020-12-23 15:05:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9341 to 9317. [2020-12-23 15:05:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9317 states. [2020-12-23 15:05:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9317 states to 9317 states and 12322 transitions. [2020-12-23 15:05:24,628 INFO L78 Accepts]: Start accepts. Automaton has 9317 states and 12322 transitions. Word has length 116 [2020-12-23 15:05:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:24,628 INFO L481 AbstractCegarLoop]: Abstraction has 9317 states and 12322 transitions. [2020-12-23 15:05:24,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:05:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9317 states and 12322 transitions. [2020-12-23 15:05:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 15:05:24,641 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:24,641 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:24,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 15:05:24,856 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash 938124799, now seen corresponding path program 1 times [2020-12-23 15:05:24,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:24,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847140034] [2020-12-23 15:05:24,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 15:05:25,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847140034] [2020-12-23 15:05:25,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:05:25,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:05:25,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234453950] [2020-12-23 15:05:25,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:05:25,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:25,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:05:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:25,032 INFO L87 Difference]: Start difference. First operand 9317 states and 12322 transitions. Second operand 3 states. [2020-12-23 15:05:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:27,759 INFO L93 Difference]: Finished difference Result 21552 states and 28612 transitions. [2020-12-23 15:05:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:05:27,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2020-12-23 15:05:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:27,787 INFO L225 Difference]: With dead ends: 21552 [2020-12-23 15:05:27,787 INFO L226 Difference]: Without dead ends: 12301 [2020-12-23 15:05:27,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:05:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2020-12-23 15:05:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 12287. [2020-12-23 15:05:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12287 states. [2020-12-23 15:05:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12287 states to 12287 states and 16300 transitions. [2020-12-23 15:05:28,543 INFO L78 Accepts]: Start accepts. Automaton has 12287 states and 16300 transitions. Word has length 120 [2020-12-23 15:05:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:28,543 INFO L481 AbstractCegarLoop]: Abstraction has 12287 states and 16300 transitions. [2020-12-23 15:05:28,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:05:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 12287 states and 16300 transitions. [2020-12-23 15:05:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 15:05:28,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:28,558 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:28,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 15:05:28,559 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1636329878, now seen corresponding path program 2 times [2020-12-23 15:05:28,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:28,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509126940] [2020-12-23 15:05:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 15:05:28,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509126940] [2020-12-23 15:05:28,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555241273] [2020-12-23 15:05:28,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:05:40,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:05:40,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:05:40,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:05:40,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:05:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 15:05:40,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:05:40,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-12-23 15:05:40,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162926086] [2020-12-23 15:05:40,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:05:40,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:40,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:05:40,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:05:40,648 INFO L87 Difference]: Start difference. First operand 12287 states and 16300 transitions. Second operand 8 states. [2020-12-23 15:05:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:41,491 INFO L93 Difference]: Finished difference Result 24571 states and 32643 transitions. [2020-12-23 15:05:41,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 15:05:41,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 120 [2020-12-23 15:05:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:41,515 INFO L225 Difference]: With dead ends: 24571 [2020-12-23 15:05:41,516 INFO L226 Difference]: Without dead ends: 12345 [2020-12-23 15:05:41,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:05:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12345 states. [2020-12-23 15:05:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12345 to 12345. [2020-12-23 15:05:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12345 states. [2020-12-23 15:05:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12345 states to 12345 states and 16358 transitions. [2020-12-23 15:05:42,087 INFO L78 Accepts]: Start accepts. Automaton has 12345 states and 16358 transitions. Word has length 120 [2020-12-23 15:05:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:42,087 INFO L481 AbstractCegarLoop]: Abstraction has 12345 states and 16358 transitions. [2020-12-23 15:05:42,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:05:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 12345 states and 16358 transitions. [2020-12-23 15:05:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 15:05:42,100 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:42,100 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:42,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 15:05:42,314 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:42,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash 441157874, now seen corresponding path program 3 times [2020-12-23 15:05:42,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:42,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095771214] [2020-12-23 15:05:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:05:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-23 15:05:42,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095771214] [2020-12-23 15:05:42,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326838799] [2020-12-23 15:05:42,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:05:54,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:05:54,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:05:54,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:05:54,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:05:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 15:05:54,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:05:54,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2020-12-23 15:05:54,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442594587] [2020-12-23 15:05:54,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:05:54,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:05:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:05:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:05:54,819 INFO L87 Difference]: Start difference. First operand 12345 states and 16358 transitions. Second operand 5 states. [2020-12-23 15:05:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:05:58,422 INFO L93 Difference]: Finished difference Result 37147 states and 49410 transitions. [2020-12-23 15:05:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:05:58,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2020-12-23 15:05:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:05:58,464 INFO L225 Difference]: With dead ends: 37147 [2020-12-23 15:05:58,465 INFO L226 Difference]: Without dead ends: 30914 [2020-12-23 15:05:58,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:05:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30914 states. [2020-12-23 15:05:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30914 to 24719. [2020-12-23 15:05:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24719 states. [2020-12-23 15:05:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24719 states to 24719 states and 32820 transitions. [2020-12-23 15:05:59,629 INFO L78 Accepts]: Start accepts. Automaton has 24719 states and 32820 transitions. Word has length 122 [2020-12-23 15:05:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:05:59,629 INFO L481 AbstractCegarLoop]: Abstraction has 24719 states and 32820 transitions. [2020-12-23 15:05:59,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:05:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 24719 states and 32820 transitions. [2020-12-23 15:05:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 15:05:59,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:05:59,643 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:05:59,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 15:05:59,859 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:05:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:05:59,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1346057549, now seen corresponding path program 1 times [2020-12-23 15:05:59,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:05:59,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068213723] [2020-12-23 15:05:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:05:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 15:06:00,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068213723] [2020-12-23 15:06:00,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:00,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:06:00,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885219820] [2020-12-23 15:06:00,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:06:00,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:06:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:06:00,041 INFO L87 Difference]: Start difference. First operand 24719 states and 32820 transitions. Second operand 4 states. [2020-12-23 15:06:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:02,549 INFO L93 Difference]: Finished difference Result 85102 states and 113293 transitions. [2020-12-23 15:06:02,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:06:02,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2020-12-23 15:06:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:02,643 INFO L225 Difference]: With dead ends: 85102 [2020-12-23 15:06:02,643 INFO L226 Difference]: Without dead ends: 66495 [2020-12-23 15:06:02,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:06:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66495 states. [2020-12-23 15:06:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66495 to 25031. [2020-12-23 15:06:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25031 states. [2020-12-23 15:06:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25031 states to 25031 states and 33262 transitions. [2020-12-23 15:06:04,187 INFO L78 Accepts]: Start accepts. Automaton has 25031 states and 33262 transitions. Word has length 124 [2020-12-23 15:06:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:04,188 INFO L481 AbstractCegarLoop]: Abstraction has 25031 states and 33262 transitions. [2020-12-23 15:06:04,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:06:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 25031 states and 33262 transitions. [2020-12-23 15:06:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-23 15:06:04,201 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:04,201 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:06:04,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 15:06:04,201 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:06:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1586108454, now seen corresponding path program 1 times [2020-12-23 15:06:04,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:04,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247516649] [2020-12-23 15:06:04,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-23 15:06:04,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247516649] [2020-12-23 15:06:04,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223690293] [2020-12-23 15:06:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:05,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 1736 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 15:06:05,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-23 15:06:05,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:06:05,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-12-23 15:06:05,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679893865] [2020-12-23 15:06:05,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 15:06:05,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 15:06:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:06:05,341 INFO L87 Difference]: Start difference. First operand 25031 states and 33262 transitions. Second operand 10 states. [2020-12-23 15:06:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:06,497 INFO L93 Difference]: Finished difference Result 50114 states and 66678 transitions. [2020-12-23 15:06:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 15:06:06,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2020-12-23 15:06:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:06,524 INFO L225 Difference]: With dead ends: 50114 [2020-12-23 15:06:06,524 INFO L226 Difference]: Without dead ends: 25145 [2020-12-23 15:06:06,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:06:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25145 states. [2020-12-23 15:06:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25145 to 25145. [2020-12-23 15:06:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25145 states. [2020-12-23 15:06:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25145 states to 25145 states and 33376 transitions. [2020-12-23 15:06:07,675 INFO L78 Accepts]: Start accepts. Automaton has 25145 states and 33376 transitions. Word has length 126 [2020-12-23 15:06:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:07,675 INFO L481 AbstractCegarLoop]: Abstraction has 25145 states and 33376 transitions. [2020-12-23 15:06:07,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 15:06:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 25145 states and 33376 transitions. [2020-12-23 15:06:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 15:06:07,684 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:07,684 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:06:07,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:07,899 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:06:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash 524798270, now seen corresponding path program 2 times [2020-12-23 15:06:07,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:07,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605013126] [2020-12-23 15:06:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 15:06:08,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605013126] [2020-12-23 15:06:08,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347872061] [2020-12-23 15:06:08,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:19,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:06:19,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:06:19,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 1748 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:06:19,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 15:06:19,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:06:19,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 15:06:19,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686729302] [2020-12-23 15:06:19,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:06:19,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:19,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:06:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:06:19,856 INFO L87 Difference]: Start difference. First operand 25145 states and 33376 transitions. Second operand 6 states. [2020-12-23 15:06:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:21,009 INFO L93 Difference]: Finished difference Result 50436 states and 66957 transitions. [2020-12-23 15:06:21,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:06:21,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2020-12-23 15:06:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:21,036 INFO L225 Difference]: With dead ends: 50436 [2020-12-23 15:06:21,036 INFO L226 Difference]: Without dead ends: 25361 [2020-12-23 15:06:21,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:06:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25361 states. [2020-12-23 15:06:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25361 to 25289. [2020-12-23 15:06:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25289 states. [2020-12-23 15:06:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25289 states to 25289 states and 33520 transitions. [2020-12-23 15:06:22,215 INFO L78 Accepts]: Start accepts. Automaton has 25289 states and 33520 transitions. Word has length 128 [2020-12-23 15:06:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:22,215 INFO L481 AbstractCegarLoop]: Abstraction has 25289 states and 33520 transitions. [2020-12-23 15:06:22,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:06:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 25289 states and 33520 transitions. [2020-12-23 15:06:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 15:06:22,225 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:22,225 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:06:22,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 15:06:22,440 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:06:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2104666046, now seen corresponding path program 3 times [2020-12-23 15:06:22,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:22,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610304307] [2020-12-23 15:06:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 15:06:22,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610304307] [2020-12-23 15:06:22,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881726419] [2020-12-23 15:06:22,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:37,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:06:37,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:06:37,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 15:06:37,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-12-23 15:06:37,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:06:37,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2020-12-23 15:06:37,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78640667] [2020-12-23 15:06:37,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:06:37,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:06:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:06:37,534 INFO L87 Difference]: Start difference. First operand 25289 states and 33520 transitions. Second operand 5 states. [2020-12-23 15:06:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:42,239 INFO L93 Difference]: Finished difference Result 105969 states and 142172 transitions. [2020-12-23 15:06:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:06:42,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2020-12-23 15:06:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:42,332 INFO L225 Difference]: With dead ends: 105969 [2020-12-23 15:06:42,333 INFO L226 Difference]: Without dead ends: 80750 [2020-12-23 15:06:42,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-23 15:06:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80750 states. [2020-12-23 15:06:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80750 to 25705. [2020-12-23 15:06:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2020-12-23 15:06:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 33936 transitions. [2020-12-23 15:06:44,233 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 33936 transitions. Word has length 130 [2020-12-23 15:06:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:44,233 INFO L481 AbstractCegarLoop]: Abstraction has 25705 states and 33936 transitions. [2020-12-23 15:06:44,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:06:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 33936 transitions. [2020-12-23 15:06:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 15:06:44,241 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:44,241 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:06:44,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 15:06:44,442 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:06:44,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1471801849, now seen corresponding path program 1 times [2020-12-23 15:06:44,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:44,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502927047] [2020-12-23 15:06:44,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 15:06:44,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502927047] [2020-12-23 15:06:44,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956518269] [2020-12-23 15:06:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:45,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:06:45,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 15:06:45,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:06:45,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-12-23 15:06:45,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807304708] [2020-12-23 15:06:45,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:06:45,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:45,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:06:45,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:06:45,768 INFO L87 Difference]: Start difference. First operand 25705 states and 33936 transitions. Second operand 7 states. [2020-12-23 15:06:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:47,439 INFO L93 Difference]: Finished difference Result 51484 states and 68005 transitions. [2020-12-23 15:06:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:06:47,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2020-12-23 15:06:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:47,472 INFO L225 Difference]: With dead ends: 51484 [2020-12-23 15:06:47,472 INFO L226 Difference]: Without dead ends: 25849 [2020-12-23 15:06:47,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:06:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25849 states. [2020-12-23 15:06:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25849 to 25849. [2020-12-23 15:06:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2020-12-23 15:06:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 34080 transitions. [2020-12-23 15:06:48,930 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 34080 transitions. Word has length 131 [2020-12-23 15:06:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:48,930 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 34080 transitions. [2020-12-23 15:06:48,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:06:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 34080 transitions. [2020-12-23 15:06:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 15:06:48,938 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:48,938 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:06:49,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 15:06:49,140 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:06:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:49,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1727673917, now seen corresponding path program 2 times [2020-12-23 15:06:49,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:49,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291479190] [2020-12-23 15:06:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-23 15:06:50,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291479190] [2020-12-23 15:06:50,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:50,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:06:50,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848448489] [2020-12-23 15:06:50,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:06:50,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:06:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:06:50,077 INFO L87 Difference]: Start difference. First operand 25849 states and 34080 transitions. Second operand 4 states. [2020-12-23 15:06:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:52,935 INFO L93 Difference]: Finished difference Result 38859 states and 51267 transitions. [2020-12-23 15:06:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:06:52,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 15:06:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:52,950 INFO L225 Difference]: With dead ends: 38859 [2020-12-23 15:06:52,950 INFO L226 Difference]: Without dead ends: 13072 [2020-12-23 15:06:52,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:06:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13072 states. [2020-12-23 15:06:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13072 to 12997. [2020-12-23 15:06:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12997 states. [2020-12-23 15:06:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12997 states to 12997 states and 17155 transitions. [2020-12-23 15:06:53,661 INFO L78 Accepts]: Start accepts. Automaton has 12997 states and 17155 transitions. Word has length 133 [2020-12-23 15:06:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:53,662 INFO L481 AbstractCegarLoop]: Abstraction has 12997 states and 17155 transitions. [2020-12-23 15:06:53,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:06:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 12997 states and 17155 transitions. [2020-12-23 15:06:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 15:06:53,667 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:53,668 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:06:53,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 15:06:53,668 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:06:53,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -151457029, now seen corresponding path program 1 times [2020-12-23 15:06:53,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:53,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706872379] [2020-12-23 15:06:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-23 15:06:54,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706872379] [2020-12-23 15:06:54,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:54,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 15:06:54,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417682964] [2020-12-23 15:06:54,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 15:06:54,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:54,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 15:06:54,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:06:54,713 INFO L87 Difference]: Start difference. First operand 12997 states and 17155 transitions. Second operand 10 states. [2020-12-23 15:07:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:07:01,733 INFO L93 Difference]: Finished difference Result 59069 states and 78244 transitions. [2020-12-23 15:07:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 15:07:01,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-12-23 15:07:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:07:01,785 INFO L225 Difference]: With dead ends: 59069 [2020-12-23 15:07:01,786 INFO L226 Difference]: Without dead ends: 46157 [2020-12-23 15:07:01,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2020-12-23 15:07:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46157 states. [2020-12-23 15:07:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46157 to 13153. [2020-12-23 15:07:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13153 states. [2020-12-23 15:07:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13153 states to 13153 states and 17259 transitions. [2020-12-23 15:07:03,300 INFO L78 Accepts]: Start accepts. Automaton has 13153 states and 17259 transitions. Word has length 133 [2020-12-23 15:07:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:07:03,301 INFO L481 AbstractCegarLoop]: Abstraction has 13153 states and 17259 transitions. [2020-12-23 15:07:03,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 15:07:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 13153 states and 17259 transitions. [2020-12-23 15:07:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 15:07:03,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:07:03,305 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:07:03,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 15:07:03,305 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:07:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:07:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1841371975, now seen corresponding path program 1 times [2020-12-23 15:07:03,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:07:03,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735791334] [2020-12-23 15:07:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:07:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:07:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 15:07:03,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735791334] [2020-12-23 15:07:03,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:07:03,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:07:03,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679588159] [2020-12-23 15:07:03,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:07:03,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:07:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:07:03,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:07:03,605 INFO L87 Difference]: Start difference. First operand 13153 states and 17259 transitions. Second operand 5 states. [2020-12-23 15:07:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:07:14,350 INFO L93 Difference]: Finished difference Result 96248 states and 128494 transitions. [2020-12-23 15:07:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 15:07:14,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-12-23 15:07:14,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:07:14,452 INFO L225 Difference]: With dead ends: 96248 [2020-12-23 15:07:14,453 INFO L226 Difference]: Without dead ends: 83180 [2020-12-23 15:07:14,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:07:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83180 states. [2020-12-23 15:07:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83180 to 13309. [2020-12-23 15:07:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13309 states. [2020-12-23 15:07:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13309 states to 13309 states and 17415 transitions. [2020-12-23 15:07:16,805 INFO L78 Accepts]: Start accepts. Automaton has 13309 states and 17415 transitions. Word has length 135 [2020-12-23 15:07:16,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:07:16,805 INFO L481 AbstractCegarLoop]: Abstraction has 13309 states and 17415 transitions. [2020-12-23 15:07:16,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:07:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 13309 states and 17415 transitions. [2020-12-23 15:07:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-23 15:07:16,810 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:07:16,811 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:07:16,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 15:07:16,811 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:07:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:07:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash 618714123, now seen corresponding path program 1 times [2020-12-23 15:07:16,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:07:16,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536802553] [2020-12-23 15:07:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:07:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:07:18,391 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-12-23 15:07:18,638 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-12-23 15:07:18,971 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2020-12-23 15:07:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 15:07:19,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536802553] [2020-12-23 15:07:19,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:07:19,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 15:07:19,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814424545] [2020-12-23 15:07:19,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 15:07:19,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:07:19,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 15:07:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-12-23 15:07:19,320 INFO L87 Difference]: Start difference. First operand 13309 states and 17415 transitions. Second operand 14 states. [2020-12-23 15:07:51,273 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2020-12-23 15:07:52,973 WARN L197 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2020-12-23 15:07:55,530 WARN L197 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 118 [2020-12-23 15:08:00,933 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 151 DAG size of output: 142 [2020-12-23 15:08:10,224 WARN L197 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 163 DAG size of output: 154