/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-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 15:30:12,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 15:30:12,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 15:30:12,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 15:30:12,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 15:30:12,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 15:30:12,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 15:30:12,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 15:30:12,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 15:30:12,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 15:30:12,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 15:30:12,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 15:30:12,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 15:30:12,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 15:30:12,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 15:30:12,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 15:30:12,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 15:30:12,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 15:30:12,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 15:30:12,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 15:30:12,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 15:30:12,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 15:30:12,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 15:30:12,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 15:30:12,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 15:30:12,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 15:30:12,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 15:30:12,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 15:30:12,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 15:30:12,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 15:30:12,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 15:30:12,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 15:30:12,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 15:30:12,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 15:30:12,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 15:30:12,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 15:30:12,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 15:30:12,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 15:30:12,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 15:30:12,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 15:30:12,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 15:30:12,559 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:30:12,610 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 15:30:12,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 15:30:12,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 15:30:12,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 15:30:12,615 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 15:30:12,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 15:30:12,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 15:30:12,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 15:30:12,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 15:30:12,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 15:30:12,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 15:30:12,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 15:30:12,618 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 15:30:12,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 15:30:12,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 15:30:12,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 15:30:12,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 15:30:12,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:30:12,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 15:30:12,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 15:30:12,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 15:30:12,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 15:30:12,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 15:30:12,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 15:30:12,620 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 15:30:12,621 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:30:13,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 15:30:13,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 15:30:13,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 15:30:13,149 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 15:30:13,150 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 15:30:13,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2020-12-23 15:30:13,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/775852e32/b24869b403584a7ebde027f27528e075/FLAGfef16f770 [2020-12-23 15:30:14,211 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 15:30:14,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2020-12-23 15:30:14,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/775852e32/b24869b403584a7ebde027f27528e075/FLAGfef16f770 [2020-12-23 15:30:14,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/775852e32/b24869b403584a7ebde027f27528e075 [2020-12-23 15:30:14,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 15:30:14,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 15:30:14,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 15:30:14,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 15:30:14,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 15:30:14,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:30:14" (1/1) ... [2020-12-23 15:30:14,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6399ef4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:14, skipping insertion in model container [2020-12-23 15:30:14,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:30:14" (1/1) ... [2020-12-23 15:30:14,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 15:30:14,849 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] 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: StructLHS[StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],raw_lock],val],counter] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],magic] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],owner_cpu] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],owner] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],key] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],class_cache],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],class_cache],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],name] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],cpu] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],ip] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~__constr_expr_0~0,],count] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],wait_list],next] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],wait_list],prev] left hand side expression in assignment: address: IdentifierExpression[~sem,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~sz~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~signature~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~signature~0,],[BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~9,],IntegerLiteral[4294967296]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~argp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~old_ioctl~0,] left hand side expression in assignment: lhs: VariableLHS[~old_ioctl~0,] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: lhs: VariableLHS[~adp~0,] left hand side expression in assignment: lhs: VariableLHS[~kioc~0,] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~kioc~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~adapno~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: lhs: VariableLHS[~iterator~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~iterator~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~umimd~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~opcode~0,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~opcode~1,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~1,] left hand side expression in assignment: lhs: VariableLHS[~adapno~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~mbox64~0,] left hand side expression in assignment: lhs: VariableLHS[~mbox~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~mbox~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~mbox~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~pthru32~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~mbox~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~mbox~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pthru32~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[55],StructAccessExpression[IdentifierExpression[~pthru32~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~right_pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~pool~0,] left hand side expression in assignment: lhs: VariableLHS[~right_pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~pool~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~pool~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~pool~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~1,] left hand side expression in assignment: lhs: VariableLHS[~tp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~__wait~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__int~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~adp,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~iterator~1,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: lhs: VariableLHS[~adapno~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~iterator~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~kioc~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~opcode~2,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~2,] left hand side expression in assignment: lhs: VariableLHS[~hinfo~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~mbox64~1,] left hand side expression in assignment: lhs: VariableLHS[~upthru32~0,] left hand side expression in assignment: lhs: VariableLHS[~kpthru32~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[13],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[14],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~adapter~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[27],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[55],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[231],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[239],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~mbox_list~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~kioc~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[200],StructAccessExpression[IdentifierExpression[~kioc~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~3,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~adapter~3,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~3,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~bufsize~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~pool~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~bufsize~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~4,] left hand side expression in assignment: lhs: VariableLHS[~adapter~4,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~adapter~4,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~kioc~4,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~pool~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~pool~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~lsi_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~lsi_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~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~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~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_0~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___1~5,] 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_1~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[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] [2020-12-23 15:30:16,117 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-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[145794,145807] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_lock~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] [2020-12-23 15:30:16,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:30:16,195 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] 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[~#__constr_expr_0~0,],base],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~sem,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~sz~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#signature~0,],base],StructAccessExpression[IdentifierExpression[~#signature~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#signature~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#signature~0,],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~9,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~argp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~old_ioctl~0,] left hand side expression in assignment: lhs: VariableLHS[~old_ioctl~0,] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: lhs: VariableLHS[~adp~0,] left hand side expression in assignment: lhs: VariableLHS[~kioc~0,] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~kioc~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~adapno~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: lhs: VariableLHS[~iterator~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~iterator~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~umimd~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~opcode~0,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~opcode~1,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~1,] left hand side expression in assignment: lhs: VariableLHS[~adapno~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~mbox64~0,] left hand side expression in assignment: lhs: VariableLHS[~mbox~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~mbox~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~mbox~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~pthru32~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~mbox~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~mbox~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pthru32~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[55],StructAccessExpression[IdentifierExpression[~pthru32~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~right_pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~pool~0,] left hand side expression in assignment: lhs: VariableLHS[~right_pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~pool~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~pool~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~pool~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~1,] left hand side expression in assignment: lhs: VariableLHS[~tp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__wait~0,],base],StructAccessExpression[IdentifierExpression[~#__wait~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~__int~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~adp,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~iterator~1,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: lhs: VariableLHS[~adapno~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~iterator~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~kioc~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~opcode~2,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~2,] left hand side expression in assignment: lhs: VariableLHS[~hinfo~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~mbox64~1,] left hand side expression in assignment: lhs: VariableLHS[~upthru32~0,] left hand side expression in assignment: lhs: VariableLHS[~kpthru32~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[13],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[14],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~adapter~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[27],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[55],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[231],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[239],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~mbox_list~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~kioc~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[200],StructAccessExpression[IdentifierExpression[~kioc~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: address: IdentifierExpression[~#adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~3,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~adapter~3,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~3,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~bufsize~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~pool~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~bufsize~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~4,] left hand side expression in assignment: lhs: VariableLHS[~adapter~4,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: address: IdentifierExpression[~#adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~adapter~4,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~kioc~4,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~pool~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~pool~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~lsi_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~lsi_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~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~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~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_0~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___1~5,] 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_1~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[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] [2020-12-23 15:30:16,540 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-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[145794,145807] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_lock~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] [2020-12-23 15:30:16,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:30:16,769 INFO L208 MainTranslator]: Completed translation [2020-12-23 15:30:16,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16 WrapperNode [2020-12-23 15:30:16,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 15:30:16,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 15:30:16,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 15:30:16,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 15:30:16,782 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:30:16" (1/1) ... [2020-12-23 15:30:16,932 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:30:16" (1/1) ... [2020-12-23 15:30:17,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 15:30:17,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 15:30:17,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 15:30:17,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 15:30:17,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16" (1/1) ... [2020-12-23 15:30:17,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16" (1/1) ... [2020-12-23 15:30:17,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16" (1/1) ... [2020-12-23 15:30:17,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16" (1/1) ... [2020-12-23 15:30:17,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16" (1/1) ... [2020-12-23 15:30:17,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16" (1/1) ... [2020-12-23 15:30:17,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16" (1/1) ... [2020-12-23 15:30:17,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 15:30:17,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 15:30:17,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 15:30:17,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 15:30:17,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16" (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:30:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-12-23 15:30:17,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-12-23 15:30:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-23 15:30:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 15:30:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 15:30:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 15:30:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 15:30:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 15:30:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 15:30:17,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 15:30:17,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 15:30:17,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 15:30:17,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 15:30:17,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-12-23 15:30:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 15:30:17,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 15:30:25,360 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 15:30:25,360 INFO L299 CfgBuilder]: Removed 938 assume(true) statements. [2020-12-23 15:30:25,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:30:25 BoogieIcfgContainer [2020-12-23 15:30:25,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 15:30:25,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 15:30:25,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 15:30:25,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 15:30:25,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:30:14" (1/3) ... [2020-12-23 15:30:25,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d946587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:30:25, skipping insertion in model container [2020-12-23 15:30:25,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:16" (2/3) ... [2020-12-23 15:30:25,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d946587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:30:25, skipping insertion in model container [2020-12-23 15:30:25,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:30:25" (3/3) ... [2020-12-23 15:30:25,379 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2020-12-23 15:30:25,391 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 15:30:25,398 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-12-23 15:30:25,422 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-23 15:30:25,480 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 15:30:25,480 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 15:30:25,481 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 15:30:25,481 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 15:30:25,481 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 15:30:25,481 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 15:30:25,481 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 15:30:25,481 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 15:30:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-12-23 15:30:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 15:30:25,556 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:25,557 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, 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:30:25,558 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:25,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash -453684691, now seen corresponding path program 1 times [2020-12-23 15:30:25,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:25,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113751720] [2020-12-23 15:30:25,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:26,314 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:30:26,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113751720] [2020-12-23 15:30:26,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:26,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:30:26,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031620102] [2020-12-23 15:30:26,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 15:30:26,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:26,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 15:30:26,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 15:30:26,339 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 2 states. [2020-12-23 15:30:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:26,436 INFO L93 Difference]: Finished difference Result 1482 states and 2059 transitions. [2020-12-23 15:30:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 15:30:26,438 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 74 [2020-12-23 15:30:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:26,478 INFO L225 Difference]: With dead ends: 1482 [2020-12-23 15:30:26,480 INFO L226 Difference]: Without dead ends: 738 [2020-12-23 15:30:26,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 15:30:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-12-23 15:30:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2020-12-23 15:30:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2020-12-23 15:30:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1006 transitions. [2020-12-23 15:30:26,607 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1006 transitions. Word has length 74 [2020-12-23 15:30:26,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:26,607 INFO L481 AbstractCegarLoop]: Abstraction has 738 states and 1006 transitions. [2020-12-23 15:30:26,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 15:30:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1006 transitions. [2020-12-23 15:30:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 15:30:26,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:26,613 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, 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:30:26,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 15:30:26,614 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1696617127, now seen corresponding path program 1 times [2020-12-23 15:30:26,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:26,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747342634] [2020-12-23 15:30:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:26,989 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:30:26,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747342634] [2020-12-23 15:30:26,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:26,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:30:26,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419487935] [2020-12-23 15:30:26,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:26,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:26,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:26,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:26,993 INFO L87 Difference]: Start difference. First operand 738 states and 1006 transitions. Second operand 3 states. [2020-12-23 15:30:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:27,142 INFO L93 Difference]: Finished difference Result 1479 states and 2021 transitions. [2020-12-23 15:30:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:27,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-12-23 15:30:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:27,151 INFO L225 Difference]: With dead ends: 1479 [2020-12-23 15:30:27,151 INFO L226 Difference]: Without dead ends: 759 [2020-12-23 15:30:27,156 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:30:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2020-12-23 15:30:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 756. [2020-12-23 15:30:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2020-12-23 15:30:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1033 transitions. [2020-12-23 15:30:27,210 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1033 transitions. Word has length 75 [2020-12-23 15:30:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:27,212 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 1033 transitions. [2020-12-23 15:30:27,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1033 transitions. [2020-12-23 15:30:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 15:30:27,214 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:27,216 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, 1] [2020-12-23 15:30:27,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 15:30:27,219 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1668587877, now seen corresponding path program 1 times [2020-12-23 15:30:27,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:27,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888989084] [2020-12-23 15:30:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 15:30:27,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888989084] [2020-12-23 15:30:27,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:27,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:30:27,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074955716] [2020-12-23 15:30:27,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:27,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:27,567 INFO L87 Difference]: Start difference. First operand 756 states and 1033 transitions. Second operand 3 states. [2020-12-23 15:30:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:28,007 INFO L93 Difference]: Finished difference Result 1527 states and 2097 transitions. [2020-12-23 15:30:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:28,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 15:30:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:28,021 INFO L225 Difference]: With dead ends: 1527 [2020-12-23 15:30:28,021 INFO L226 Difference]: Without dead ends: 789 [2020-12-23 15:30:28,023 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:30:28,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-12-23 15:30:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 786. [2020-12-23 15:30:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-12-23 15:30:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1077 transitions. [2020-12-23 15:30:28,055 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1077 transitions. Word has length 101 [2020-12-23 15:30:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:28,057 INFO L481 AbstractCegarLoop]: Abstraction has 786 states and 1077 transitions. [2020-12-23 15:30:28,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1077 transitions. [2020-12-23 15:30:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 15:30:28,067 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:28,068 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 15:30:28,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 15:30:28,069 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1271589435, now seen corresponding path program 1 times [2020-12-23 15:30:28,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:28,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458148802] [2020-12-23 15:30:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:30:28,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458148802] [2020-12-23 15:30:28,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:28,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:30:28,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265134271] [2020-12-23 15:30:28,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:28,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:28,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:28,360 INFO L87 Difference]: Start difference. First operand 786 states and 1077 transitions. Second operand 3 states. [2020-12-23 15:30:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:28,437 INFO L93 Difference]: Finished difference Result 2320 states and 3182 transitions. [2020-12-23 15:30:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:28,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-23 15:30:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:28,447 INFO L225 Difference]: With dead ends: 2320 [2020-12-23 15:30:28,448 INFO L226 Difference]: Without dead ends: 1552 [2020-12-23 15:30:28,451 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:30:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2020-12-23 15:30:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 787. [2020-12-23 15:30:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-12-23 15:30:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1078 transitions. [2020-12-23 15:30:28,483 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1078 transitions. Word has length 115 [2020-12-23 15:30:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:28,486 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 1078 transitions. [2020-12-23 15:30:28,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1078 transitions. [2020-12-23 15:30:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 15:30:28,488 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:28,489 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 15:30:28,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 15:30:28,489 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:28,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1069765501, now seen corresponding path program 1 times [2020-12-23 15:30:28,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:28,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553120950] [2020-12-23 15:30:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:28,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553120950] [2020-12-23 15:30:28,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:28,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:30:28,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637337804] [2020-12-23 15:30:28,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:28,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:28,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:28,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:28,739 INFO L87 Difference]: Start difference. First operand 787 states and 1078 transitions. Second operand 3 states. [2020-12-23 15:30:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:28,793 INFO L93 Difference]: Finished difference Result 1558 states and 2137 transitions. [2020-12-23 15:30:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:28,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-23 15:30:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:28,799 INFO L225 Difference]: With dead ends: 1558 [2020-12-23 15:30:28,800 INFO L226 Difference]: Without dead ends: 789 [2020-12-23 15:30:28,802 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:30:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-12-23 15:30:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2020-12-23 15:30:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-12-23 15:30:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1080 transitions. [2020-12-23 15:30:28,825 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1080 transitions. Word has length 115 [2020-12-23 15:30:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:28,826 INFO L481 AbstractCegarLoop]: Abstraction has 789 states and 1080 transitions. [2020-12-23 15:30:28,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1080 transitions. [2020-12-23 15:30:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 15:30:28,828 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:28,829 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 15:30:28,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 15:30:28,829 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1462792511, now seen corresponding path program 1 times [2020-12-23 15:30:28,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:28,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481366857] [2020-12-23 15:30:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:29,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481366857] [2020-12-23 15:30:29,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:29,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:30:29,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093120881] [2020-12-23 15:30:29,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:29,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:29,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:29,105 INFO L87 Difference]: Start difference. First operand 789 states and 1080 transitions. Second operand 3 states. [2020-12-23 15:30:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:29,537 INFO L93 Difference]: Finished difference Result 2247 states and 3092 transitions. [2020-12-23 15:30:29,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:29,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-23 15:30:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:29,550 INFO L225 Difference]: With dead ends: 2247 [2020-12-23 15:30:29,550 INFO L226 Difference]: Without dead ends: 1476 [2020-12-23 15:30:29,552 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:30:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-12-23 15:30:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 795. [2020-12-23 15:30:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-12-23 15:30:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1086 transitions. [2020-12-23 15:30:29,589 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1086 transitions. Word has length 115 [2020-12-23 15:30:29,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:29,590 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 1086 transitions. [2020-12-23 15:30:29,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1086 transitions. [2020-12-23 15:30:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 15:30:29,594 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:29,594 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 15:30:29,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 15:30:29,595 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash 556019336, now seen corresponding path program 1 times [2020-12-23 15:30:29,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:29,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849241116] [2020-12-23 15:30:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:29,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849241116] [2020-12-23 15:30:29,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257116873] [2020-12-23 15:30:29,826 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:30:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:30,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 1840 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:30:30,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 15:30:30,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:30:30,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 15:30:30,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232441588] [2020-12-23 15:30:30,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:30,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:30,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:30:30,845 INFO L87 Difference]: Start difference. First operand 795 states and 1086 transitions. Second operand 3 states. [2020-12-23 15:30:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:31,028 INFO L93 Difference]: Finished difference Result 2229 states and 3074 transitions. [2020-12-23 15:30:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:31,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2020-12-23 15:30:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:31,037 INFO L225 Difference]: With dead ends: 2229 [2020-12-23 15:30:31,037 INFO L226 Difference]: Without dead ends: 1452 [2020-12-23 15:30:31,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:30:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-12-23 15:30:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 831. [2020-12-23 15:30:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2020-12-23 15:30:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1134 transitions. [2020-12-23 15:30:31,073 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1134 transitions. Word has length 119 [2020-12-23 15:30:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:31,073 INFO L481 AbstractCegarLoop]: Abstraction has 831 states and 1134 transitions. [2020-12-23 15:30:31,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1134 transitions. [2020-12-23 15:30:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 15:30:31,076 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:31,077 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2020-12-23 15:30:31,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 15:30:31,291 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1859190524, now seen corresponding path program 1 times [2020-12-23 15:30:31,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:31,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793232954] [2020-12-23 15:30:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:31,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793232954] [2020-12-23 15:30:31,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795732476] [2020-12-23 15:30:31,549 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 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:30:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:32,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:30:32,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:32,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:30:32,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 15:30:32,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573735706] [2020-12-23 15:30:32,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:30:32,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:30:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:30:32,508 INFO L87 Difference]: Start difference. First operand 831 states and 1134 transitions. Second operand 5 states. [2020-12-23 15:30:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:33,163 INFO L93 Difference]: Finished difference Result 3048 states and 4185 transitions. [2020-12-23 15:30:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:30:33,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2020-12-23 15:30:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:33,177 INFO L225 Difference]: With dead ends: 3048 [2020-12-23 15:30:33,178 INFO L226 Difference]: Without dead ends: 2235 [2020-12-23 15:30:33,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:30:33,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2020-12-23 15:30:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 897. [2020-12-23 15:30:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2020-12-23 15:30:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1212 transitions. [2020-12-23 15:30:33,225 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1212 transitions. Word has length 124 [2020-12-23 15:30:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:33,225 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 1212 transitions. [2020-12-23 15:30:33,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:30:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1212 transitions. [2020-12-23 15:30:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 15:30:33,229 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:33,229 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:33,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:30:33,444 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:33,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1755959531, now seen corresponding path program 1 times [2020-12-23 15:30:33,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:33,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179479881] [2020-12-23 15:30:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 15:30:33,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179479881] [2020-12-23 15:30:33,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:33,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:30:33,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956518628] [2020-12-23 15:30:33,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:30:33,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:33,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:30:33,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:30:33,673 INFO L87 Difference]: Start difference. First operand 897 states and 1212 transitions. Second operand 4 states. [2020-12-23 15:30:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:33,824 INFO L93 Difference]: Finished difference Result 1923 states and 2614 transitions. [2020-12-23 15:30:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:30:33,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-12-23 15:30:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:33,831 INFO L225 Difference]: With dead ends: 1923 [2020-12-23 15:30:33,831 INFO L226 Difference]: Without dead ends: 1044 [2020-12-23 15:30:33,835 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:30:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2020-12-23 15:30:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 901. [2020-12-23 15:30:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2020-12-23 15:30:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1216 transitions. [2020-12-23 15:30:33,868 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1216 transitions. Word has length 128 [2020-12-23 15:30:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:33,868 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1216 transitions. [2020-12-23 15:30:33,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:30:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1216 transitions. [2020-12-23 15:30:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 15:30:33,871 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:33,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:33,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 15:30:33,872 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:33,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1790413165, now seen corresponding path program 1 times [2020-12-23 15:30:33,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:33,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425917102] [2020-12-23 15:30:33,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 15:30:34,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425917102] [2020-12-23 15:30:34,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:34,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:30:34,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576773360] [2020-12-23 15:30:34,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:30:34,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:30:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:30:34,174 INFO L87 Difference]: Start difference. First operand 901 states and 1216 transitions. Second operand 4 states. [2020-12-23 15:30:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:34,321 INFO L93 Difference]: Finished difference Result 1931 states and 2622 transitions. [2020-12-23 15:30:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:30:34,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2020-12-23 15:30:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:34,327 INFO L225 Difference]: With dead ends: 1931 [2020-12-23 15:30:34,328 INFO L226 Difference]: Without dead ends: 1048 [2020-12-23 15:30:34,330 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:30:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2020-12-23 15:30:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 901. [2020-12-23 15:30:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2020-12-23 15:30:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1216 transitions. [2020-12-23 15:30:34,363 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1216 transitions. Word has length 135 [2020-12-23 15:30:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:34,364 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1216 transitions. [2020-12-23 15:30:34,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:30:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1216 transitions. [2020-12-23 15:30:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 15:30:34,367 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:34,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:34,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 15:30:34,367 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash 852192385, now seen corresponding path program 1 times [2020-12-23 15:30:34,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:34,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771969579] [2020-12-23 15:30:34,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:34,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771969579] [2020-12-23 15:30:34,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800037742] [2020-12-23 15:30:34,686 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 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:30:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:35,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 1964 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:30:35,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:35,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:30:35,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 15:30:35,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875280757] [2020-12-23 15:30:35,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:30:35,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:35,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:30:35,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:30:35,587 INFO L87 Difference]: Start difference. First operand 901 states and 1216 transitions. Second operand 6 states. [2020-12-23 15:30:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:36,477 INFO L93 Difference]: Finished difference Result 3851 states and 5268 transitions. [2020-12-23 15:30:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:30:36,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2020-12-23 15:30:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:36,496 INFO L225 Difference]: With dead ends: 3851 [2020-12-23 15:30:36,496 INFO L226 Difference]: Without dead ends: 2968 [2020-12-23 15:30:36,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 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:30:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-12-23 15:30:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 985. [2020-12-23 15:30:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2020-12-23 15:30:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1324 transitions. [2020-12-23 15:30:36,547 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1324 transitions. Word has length 136 [2020-12-23 15:30:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:36,548 INFO L481 AbstractCegarLoop]: Abstraction has 985 states and 1324 transitions. [2020-12-23 15:30:36,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:30:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1324 transitions. [2020-12-23 15:30:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:30:36,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:36,552 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:36,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-23 15:30:36,766 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -710651366, now seen corresponding path program 2 times [2020-12-23 15:30:36,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:36,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445761558] [2020-12-23 15:30:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:37,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445761558] [2020-12-23 15:30:37,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696874681] [2020-12-23 15:30:37,102 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 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:30:37,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:30:37,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:30:37,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-23 15:30:37,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 15:30:38,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:30:38,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2020-12-23 15:30:38,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512035623] [2020-12-23 15:30:38,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:30:38,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:38,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:30:38,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 15:30:38,017 INFO L87 Difference]: Start difference. First operand 985 states and 1324 transitions. Second operand 7 states. [2020-12-23 15:30:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:38,483 INFO L93 Difference]: Finished difference Result 2198 states and 2979 transitions. [2020-12-23 15:30:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:30:38,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2020-12-23 15:30:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:38,490 INFO L225 Difference]: With dead ends: 2198 [2020-12-23 15:30:38,491 INFO L226 Difference]: Without dead ends: 1231 [2020-12-23 15:30:38,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-12-23 15:30:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-12-23 15:30:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 991. [2020-12-23 15:30:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2020-12-23 15:30:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1330 transitions. [2020-12-23 15:30:38,536 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1330 transitions. Word has length 140 [2020-12-23 15:30:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:38,537 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 1330 transitions. [2020-12-23 15:30:38,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:30:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1330 transitions. [2020-12-23 15:30:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-23 15:30:38,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:38,541 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:38,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:30:38,755 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:38,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1270701829, now seen corresponding path program 1 times [2020-12-23 15:30:38,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:38,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697314420] [2020-12-23 15:30:38,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:39,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697314420] [2020-12-23 15:30:39,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896992826] [2020-12-23 15:30:39,183 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 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:30:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:39,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 1995 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:30:39,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:40,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:30:40,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-12-23 15:30:40,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278047933] [2020-12-23 15:30:40,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:30:40,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:40,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:30:40,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:30:40,046 INFO L87 Difference]: Start difference. First operand 991 states and 1330 transitions. Second operand 7 states. [2020-12-23 15:30:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:41,132 INFO L93 Difference]: Finished difference Result 4692 states and 6401 transitions. [2020-12-23 15:30:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:30:41,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2020-12-23 15:30:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:41,153 INFO L225 Difference]: With dead ends: 4692 [2020-12-23 15:30:41,153 INFO L226 Difference]: Without dead ends: 3719 [2020-12-23 15:30:41,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 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:30:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2020-12-23 15:30:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 1075. [2020-12-23 15:30:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2020-12-23 15:30:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1438 transitions. [2020-12-23 15:30:41,217 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1438 transitions. Word has length 141 [2020-12-23 15:30:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:41,217 INFO L481 AbstractCegarLoop]: Abstraction has 1075 states and 1438 transitions. [2020-12-23 15:30:41,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:30:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1438 transitions. [2020-12-23 15:30:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 15:30:41,251 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:41,251 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:41,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 15:30:41,452 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1491551852, now seen corresponding path program 2 times [2020-12-23 15:30:41,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:41,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987365972] [2020-12-23 15:30:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:30:41,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987365972] [2020-12-23 15:30:41,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7726558] [2020-12-23 15:30:41,737 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 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:30:42,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:30:42,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:30:42,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 1650 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:30:42,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-12-23 15:30:42,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:30:42,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2020-12-23 15:30:42,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222746109] [2020-12-23 15:30:42,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:42,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:42,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:30:42,920 INFO L87 Difference]: Start difference. First operand 1075 states and 1438 transitions. Second operand 3 states. [2020-12-23 15:30:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:42,973 INFO L93 Difference]: Finished difference Result 2136 states and 2859 transitions. [2020-12-23 15:30:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:42,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 15:30:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:42,979 INFO L225 Difference]: With dead ends: 2136 [2020-12-23 15:30:42,979 INFO L226 Difference]: Without dead ends: 1079 [2020-12-23 15:30:42,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:30:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2020-12-23 15:30:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2020-12-23 15:30:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2020-12-23 15:30:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1442 transitions. [2020-12-23 15:30:43,025 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1442 transitions. Word has length 145 [2020-12-23 15:30:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:43,025 INFO L481 AbstractCegarLoop]: Abstraction has 1079 states and 1442 transitions. [2020-12-23 15:30:43,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1442 transitions. [2020-12-23 15:30:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-23 15:30:43,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:43,030 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:43,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:30:43,243 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:43,244 INFO L82 PathProgramCache]: Analyzing trace with hash 315784985, now seen corresponding path program 1 times [2020-12-23 15:30:43,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:43,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765348528] [2020-12-23 15:30:43,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 15:30:43,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765348528] [2020-12-23 15:30:43,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378099313] [2020-12-23 15:30:43,576 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:30:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:44,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 15:30:44,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 15:30:44,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:30:44,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-23 15:30:44,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773085857] [2020-12-23 15:30:44,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:30:44,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:44,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:30:44,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:30:44,447 INFO L87 Difference]: Start difference. First operand 1079 states and 1442 transitions. Second operand 8 states. [2020-12-23 15:30:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:45,671 INFO L93 Difference]: Finished difference Result 5447 states and 7424 transitions. [2020-12-23 15:30:45,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:30:45,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 147 [2020-12-23 15:30:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:45,702 INFO L225 Difference]: With dead ends: 5447 [2020-12-23 15:30:45,702 INFO L226 Difference]: Without dead ends: 4386 [2020-12-23 15:30:45,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:30:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2020-12-23 15:30:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 1163. [2020-12-23 15:30:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2020-12-23 15:30:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1550 transitions. [2020-12-23 15:30:45,778 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1550 transitions. Word has length 147 [2020-12-23 15:30:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:45,778 INFO L481 AbstractCegarLoop]: Abstraction has 1163 states and 1550 transitions. [2020-12-23 15:30:45,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:30:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1550 transitions. [2020-12-23 15:30:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-23 15:30:45,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:45,783 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:45,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 15:30:45,997 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1613781170, now seen corresponding path program 2 times [2020-12-23 15:30:45,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:45,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700019173] [2020-12-23 15:30:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:30:46,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700019173] [2020-12-23 15:30:46,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266306210] [2020-12-23 15:30:46,303 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:30:47,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:30:47,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:30:47,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 1650 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:30:47,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2020-12-23 15:30:47,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:30:47,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2020-12-23 15:30:47,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925981361] [2020-12-23 15:30:47,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:30:47,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:30:47,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:30:47,959 INFO L87 Difference]: Start difference. First operand 1163 states and 1550 transitions. Second operand 5 states. [2020-12-23 15:30:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:48,521 INFO L93 Difference]: Finished difference Result 3575 states and 4788 transitions. [2020-12-23 15:30:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:30:48,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2020-12-23 15:30:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:48,535 INFO L225 Difference]: With dead ends: 3575 [2020-12-23 15:30:48,535 INFO L226 Difference]: Without dead ends: 2430 [2020-12-23 15:30:48,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:30:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2020-12-23 15:30:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1169. [2020-12-23 15:30:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2020-12-23 15:30:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1556 transitions. [2020-12-23 15:30:48,615 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1556 transitions. Word has length 151 [2020-12-23 15:30:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:48,615 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1556 transitions. [2020-12-23 15:30:48,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:30:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1556 transitions. [2020-12-23 15:30:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-12-23 15:30:48,620 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:48,620 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:48,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 15:30:48,835 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash -720066253, now seen corresponding path program 1 times [2020-12-23 15:30:48,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:48,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273199229] [2020-12-23 15:30:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:30:49,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273199229] [2020-12-23 15:30:49,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336685851] [2020-12-23 15:30:49,167 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:30:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:52,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 2043 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-23 15:30:52,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:30:52,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:30:52,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 15:30:52,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165856870] [2020-12-23 15:30:52,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:30:52,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:52,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:30:52,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:30:52,223 INFO L87 Difference]: Start difference. First operand 1169 states and 1556 transitions. Second operand 5 states. [2020-12-23 15:30:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:52,320 INFO L93 Difference]: Finished difference Result 2324 states and 3095 transitions. [2020-12-23 15:30:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:30:52,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2020-12-23 15:30:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:52,325 INFO L225 Difference]: With dead ends: 2324 [2020-12-23 15:30:52,325 INFO L226 Difference]: Without dead ends: 1173 [2020-12-23 15:30:52,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:30:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-12-23 15:30:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2020-12-23 15:30:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2020-12-23 15:30:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1560 transitions. [2020-12-23 15:30:52,385 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1560 transitions. Word has length 152 [2020-12-23 15:30:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:52,385 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1560 transitions. [2020-12-23 15:30:52,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:30:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1560 transitions. [2020-12-23 15:30:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-23 15:30:52,390 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:52,390 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:52,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 15:30:52,604 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:52,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1228958706, now seen corresponding path program 2 times [2020-12-23 15:30:52,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:52,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952817366] [2020-12-23 15:30:52,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:30:52,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952817366] [2020-12-23 15:30:52,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675307084] [2020-12-23 15:30:52,977 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:30:54,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:30:54,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:30:54,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 1671 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:30:54,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-12-23 15:30:54,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:30:54,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-12-23 15:30:54,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283248559] [2020-12-23 15:30:54,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:30:54,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:30:54,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:30:54,871 INFO L87 Difference]: Start difference. First operand 1173 states and 1560 transitions. Second operand 5 states. [2020-12-23 15:30:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:55,493 INFO L93 Difference]: Finished difference Result 3457 states and 4632 transitions. [2020-12-23 15:30:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:30:55,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2020-12-23 15:30:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:55,501 INFO L225 Difference]: With dead ends: 3457 [2020-12-23 15:30:55,501 INFO L226 Difference]: Without dead ends: 2302 [2020-12-23 15:30:55,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-23 15:30:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2020-12-23 15:30:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 1179. [2020-12-23 15:30:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2020-12-23 15:30:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1566 transitions. [2020-12-23 15:30:55,564 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1566 transitions. Word has length 154 [2020-12-23 15:30:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:55,565 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1566 transitions. [2020-12-23 15:30:55,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:30:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1566 transitions. [2020-12-23 15:30:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-23 15:30:55,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:55,569 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:55,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 15:30:55,784 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1813384852, now seen corresponding path program 1 times [2020-12-23 15:30:55,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:55,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967044802] [2020-12-23 15:30:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:30:56,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967044802] [2020-12-23 15:30:56,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386183676] [2020-12-23 15:30:56,097 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:30:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:59,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 2071 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-23 15:30:59,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:30:59,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:30:59,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 15:30:59,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514971540] [2020-12-23 15:30:59,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:30:59,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:30:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:30:59,440 INFO L87 Difference]: Start difference. First operand 1179 states and 1566 transitions. Second operand 6 states. [2020-12-23 15:30:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:59,538 INFO L93 Difference]: Finished difference Result 2344 states and 3115 transitions. [2020-12-23 15:30:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:30:59,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2020-12-23 15:30:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:59,542 INFO L225 Difference]: With dead ends: 2344 [2020-12-23 15:30:59,542 INFO L226 Difference]: Without dead ends: 1183 [2020-12-23 15:30:59,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:30:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-12-23 15:30:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2020-12-23 15:30:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2020-12-23 15:30:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1570 transitions. [2020-12-23 15:30:59,602 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1570 transitions. Word has length 155 [2020-12-23 15:30:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:59,603 INFO L481 AbstractCegarLoop]: Abstraction has 1183 states and 1570 transitions. [2020-12-23 15:30:59,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:30:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1570 transitions. [2020-12-23 15:30:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 15:30:59,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:59,607 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:59,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:30:59,821 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash -993897295, now seen corresponding path program 2 times [2020-12-23 15:30:59,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:59,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731249565] [2020-12-23 15:30:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:31:00,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731249565] [2020-12-23 15:31:00,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314748638] [2020-12-23 15:31:00,131 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:01,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:31:01,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:31:01,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 1692 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:31:01,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-23 15:31:02,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:31:02,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-12-23 15:31:02,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377156277] [2020-12-23 15:31:02,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:31:02,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:02,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:31:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:31:02,083 INFO L87 Difference]: Start difference. First operand 1183 states and 1570 transitions. Second operand 3 states. [2020-12-23 15:31:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:02,165 INFO L93 Difference]: Finished difference Result 2463 states and 3284 transitions. [2020-12-23 15:31:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:31:02,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2020-12-23 15:31:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:02,169 INFO L225 Difference]: With dead ends: 2463 [2020-12-23 15:31:02,169 INFO L226 Difference]: Without dead ends: 1298 [2020-12-23 15:31:02,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:31:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2020-12-23 15:31:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1185. [2020-12-23 15:31:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2020-12-23 15:31:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1572 transitions. [2020-12-23 15:31:02,220 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1572 transitions. Word has length 157 [2020-12-23 15:31:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:02,220 INFO L481 AbstractCegarLoop]: Abstraction has 1185 states and 1572 transitions. [2020-12-23 15:31:02,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:31:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1572 transitions. [2020-12-23 15:31:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 15:31:02,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:02,225 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:02,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:02,438 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash 740207155, now seen corresponding path program 1 times [2020-12-23 15:31:02,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:02,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360069227] [2020-12-23 15:31:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:31:02,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360069227] [2020-12-23 15:31:02,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441534123] [2020-12-23 15:31:02,730 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:05,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 2077 conjuncts, 39 conjunts are in the unsatisfiable core [2020-12-23 15:31:05,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-23 15:31:06,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:31:06,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-12-23 15:31:06,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065288954] [2020-12-23 15:31:06,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:31:06,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:06,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:31:06,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:31:06,084 INFO L87 Difference]: Start difference. First operand 1185 states and 1572 transitions. Second operand 3 states. [2020-12-23 15:31:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:06,212 INFO L93 Difference]: Finished difference Result 2375 states and 3157 transitions. [2020-12-23 15:31:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:31:06,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2020-12-23 15:31:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:06,216 INFO L225 Difference]: With dead ends: 2375 [2020-12-23 15:31:06,216 INFO L226 Difference]: Without dead ends: 1194 [2020-12-23 15:31:06,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:31:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-12-23 15:31:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2020-12-23 15:31:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2020-12-23 15:31:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1581 transitions. [2020-12-23 15:31:06,282 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1581 transitions. Word has length 157 [2020-12-23 15:31:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:06,282 INFO L481 AbstractCegarLoop]: Abstraction has 1194 states and 1581 transitions. [2020-12-23 15:31:06,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:31:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1581 transitions. [2020-12-23 15:31:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-12-23 15:31:06,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:06,288 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:06,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-23 15:31:06,504 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1262372963, now seen corresponding path program 1 times [2020-12-23 15:31:06,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:06,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684038127] [2020-12-23 15:31:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-12-23 15:31:06,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684038127] [2020-12-23 15:31:06,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893692192] [2020-12-23 15:31:06,851 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:07,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-23 15:31:07,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-23 15:31:07,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:31:07,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2020-12-23 15:31:07,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63929635] [2020-12-23 15:31:07,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:31:07,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:07,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:31:07,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:31:07,770 INFO L87 Difference]: Start difference. First operand 1194 states and 1581 transitions. Second operand 8 states. [2020-12-23 15:31:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:08,010 INFO L93 Difference]: Finished difference Result 2389 states and 3166 transitions. [2020-12-23 15:31:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 15:31:08,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 162 [2020-12-23 15:31:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:08,014 INFO L225 Difference]: With dead ends: 2389 [2020-12-23 15:31:08,014 INFO L226 Difference]: Without dead ends: 1200 [2020-12-23 15:31:08,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:31:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-12-23 15:31:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1200. [2020-12-23 15:31:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2020-12-23 15:31:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1587 transitions. [2020-12-23 15:31:08,068 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1587 transitions. Word has length 162 [2020-12-23 15:31:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:08,068 INFO L481 AbstractCegarLoop]: Abstraction has 1200 states and 1587 transitions. [2020-12-23 15:31:08,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:31:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1587 transitions. [2020-12-23 15:31:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-12-23 15:31:08,073 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:08,073 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:08,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:08,287 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1504994470, now seen corresponding path program 2 times [2020-12-23 15:31:08,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:08,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938208895] [2020-12-23 15:31:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 15:31:08,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938208895] [2020-12-23 15:31:08,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624752283] [2020-12-23 15:31:08,660 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:10,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:31:10,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:31:10,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 1691 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:31:10,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 15:31:10,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:31:10,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2020-12-23 15:31:10,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117355081] [2020-12-23 15:31:10,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:31:10,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:10,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:31:10,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:31:10,530 INFO L87 Difference]: Start difference. First operand 1200 states and 1587 transitions. Second operand 4 states. [2020-12-23 15:31:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:10,723 INFO L93 Difference]: Finished difference Result 2731 states and 3642 transitions. [2020-12-23 15:31:10,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:31:10,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2020-12-23 15:31:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:10,728 INFO L225 Difference]: With dead ends: 2731 [2020-12-23 15:31:10,729 INFO L226 Difference]: Without dead ends: 1556 [2020-12-23 15:31:10,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:31:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2020-12-23 15:31:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1204. [2020-12-23 15:31:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2020-12-23 15:31:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1591 transitions. [2020-12-23 15:31:10,794 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1591 transitions. Word has length 166 [2020-12-23 15:31:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:10,794 INFO L481 AbstractCegarLoop]: Abstraction has 1204 states and 1591 transitions. [2020-12-23 15:31:10,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:31:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1591 transitions. [2020-12-23 15:31:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 15:31:10,799 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:10,799 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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:31:11,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 15:31:11,013 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:11,014 INFO L82 PathProgramCache]: Analyzing trace with hash -615129885, now seen corresponding path program 1 times [2020-12-23 15:31:11,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:11,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447202357] [2020-12-23 15:31:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 15:31:11,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447202357] [2020-12-23 15:31:11,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511856646] [2020-12-23 15:31:11,353 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:14,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 2142 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-23 15:31:14,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 15:31:14,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:31:14,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-23 15:31:14,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009277065] [2020-12-23 15:31:14,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:31:14,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:14,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:31:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:31:14,827 INFO L87 Difference]: Start difference. First operand 1204 states and 1591 transitions. Second operand 8 states. [2020-12-23 15:31:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:14,977 INFO L93 Difference]: Finished difference Result 2387 states and 3158 transitions. [2020-12-23 15:31:14,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:31:14,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2020-12-23 15:31:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:14,981 INFO L225 Difference]: With dead ends: 2387 [2020-12-23 15:31:14,981 INFO L226 Difference]: Without dead ends: 1208 [2020-12-23 15:31:14,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:31:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-12-23 15:31:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2020-12-23 15:31:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2020-12-23 15:31:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1595 transitions. [2020-12-23 15:31:15,034 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1595 transitions. Word has length 169 [2020-12-23 15:31:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:15,034 INFO L481 AbstractCegarLoop]: Abstraction has 1208 states and 1595 transitions. [2020-12-23 15:31:15,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:31:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1595 transitions. [2020-12-23 15:31:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 15:31:15,038 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:15,038 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 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, 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:31:15,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:15,239 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1495448962, now seen corresponding path program 2 times [2020-12-23 15:31:15,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:15,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896043717] [2020-12-23 15:31:15,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 15:31:15,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896043717] [2020-12-23 15:31:15,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302164784] [2020-12-23 15:31:15,587 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:16,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:31:16,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:31:16,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 1707 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:31:16,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-12-23 15:31:17,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:31:17,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2020-12-23 15:31:17,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031966856] [2020-12-23 15:31:17,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:31:17,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:17,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:31:17,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-12-23 15:31:17,040 INFO L87 Difference]: Start difference. First operand 1208 states and 1595 transitions. Second operand 5 states. [2020-12-23 15:31:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:17,581 INFO L93 Difference]: Finished difference Result 3146 states and 4177 transitions. [2020-12-23 15:31:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:31:17,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2020-12-23 15:31:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:17,586 INFO L225 Difference]: With dead ends: 3146 [2020-12-23 15:31:17,586 INFO L226 Difference]: Without dead ends: 1963 [2020-12-23 15:31:17,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-12-23 15:31:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2020-12-23 15:31:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1214. [2020-12-23 15:31:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2020-12-23 15:31:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1601 transitions. [2020-12-23 15:31:17,639 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1601 transitions. Word has length 171 [2020-12-23 15:31:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:17,640 INFO L481 AbstractCegarLoop]: Abstraction has 1214 states and 1601 transitions. [2020-12-23 15:31:17,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:31:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1601 transitions. [2020-12-23 15:31:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-23 15:31:17,643 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:17,643 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 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, 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:31:17,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-12-23 15:31:17,857 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash -601544216, now seen corresponding path program 1 times [2020-12-23 15:31:17,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:17,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274171196] [2020-12-23 15:31:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 15:31:18,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274171196] [2020-12-23 15:31:18,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274251164] [2020-12-23 15:31:18,172 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:20,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 2170 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-23 15:31:20,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 15:31:20,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:31:20,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-12-23 15:31:20,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012962026] [2020-12-23 15:31:20,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 15:31:20,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:20,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 15:31:20,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:31:20,813 INFO L87 Difference]: Start difference. First operand 1214 states and 1601 transitions. Second operand 9 states. [2020-12-23 15:31:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:20,977 INFO L93 Difference]: Finished difference Result 2407 states and 3178 transitions. [2020-12-23 15:31:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 15:31:20,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2020-12-23 15:31:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:20,980 INFO L225 Difference]: With dead ends: 2407 [2020-12-23 15:31:20,981 INFO L226 Difference]: Without dead ends: 1218 [2020-12-23 15:31:20,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:31:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-12-23 15:31:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2020-12-23 15:31:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2020-12-23 15:31:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1605 transitions. [2020-12-23 15:31:21,027 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1605 transitions. Word has length 172 [2020-12-23 15:31:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:21,027 INFO L481 AbstractCegarLoop]: Abstraction has 1218 states and 1605 transitions. [2020-12-23 15:31:21,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 15:31:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1605 transitions. [2020-12-23 15:31:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-12-23 15:31:21,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:21,031 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 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, 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:31:21,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-23 15:31:21,245 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1116857747, now seen corresponding path program 2 times [2020-12-23 15:31:21,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:21,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329390758] [2020-12-23 15:31:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 15:31:21,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329390758] [2020-12-23 15:31:21,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047493582] [2020-12-23 15:31:21,685 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:32:17,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:32:17,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:32:17,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 2177 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-23 15:32:17,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:32:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 15:32:17,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:32:17,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-12-23 15:32:17,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290285931] [2020-12-23 15:32:17,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 15:32:17,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:32:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 15:32:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:32:17,469 INFO L87 Difference]: Start difference. First operand 1218 states and 1605 transitions. Second operand 10 states. [2020-12-23 15:32:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:32:17,659 INFO L93 Difference]: Finished difference Result 2415 states and 3186 transitions. [2020-12-23 15:32:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 15:32:17,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2020-12-23 15:32:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:32:17,662 INFO L225 Difference]: With dead ends: 2415 [2020-12-23 15:32:17,662 INFO L226 Difference]: Without dead ends: 1222 [2020-12-23 15:32:17,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:32:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-12-23 15:32:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2020-12-23 15:32:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2020-12-23 15:32:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1609 transitions. [2020-12-23 15:32:17,716 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1609 transitions. Word has length 174 [2020-12-23 15:32:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:32:17,716 INFO L481 AbstractCegarLoop]: Abstraction has 1222 states and 1609 transitions. [2020-12-23 15:32:17,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 15:32:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1609 transitions. [2020-12-23 15:32:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 15:32:17,720 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:32:17,721 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 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, 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:32:17,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-23 15:32:17,934 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:32:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:32:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1883045298, now seen corresponding path program 3 times [2020-12-23 15:32:17,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:32:17,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272134847] [2020-12-23 15:32:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:32:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:32:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 15:32:18,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272134847] [2020-12-23 15:32:18,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130547182] [2020-12-23 15:32:18,294 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:34:23,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:34:23,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:34:23,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 15:34:23,821 INFO L286 TraceCheckSpWp]: Computing forward predicates...