/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-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:06:16,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 15:06:16,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 15:06:17,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 15:06:17,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 15:06:17,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 15:06:17,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 15:06:17,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 15:06:17,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 15:06:17,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 15:06:17,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 15:06:17,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 15:06:17,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 15:06:17,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 15:06:17,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 15:06:17,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 15:06:17,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 15:06:17,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 15:06:17,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 15:06:17,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 15:06:17,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 15:06:17,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 15:06:17,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 15:06:17,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 15:06:17,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 15:06:17,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 15:06:17,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 15:06:17,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 15:06:17,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 15:06:17,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 15:06:17,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 15:06:17,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 15:06:17,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 15:06:17,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 15:06:17,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 15:06:17,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 15:06:17,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 15:06:17,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 15:06:17,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 15:06:17,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 15:06:17,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 15:06:17,158 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:06:17,215 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 15:06:17,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 15:06:17,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 15:06:17,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 15:06:17,221 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 15:06:17,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 15:06:17,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 15:06:17,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 15:06:17,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 15:06:17,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 15:06:17,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 15:06:17,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 15:06:17,224 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 15:06:17,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 15:06:17,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 15:06:17,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 15:06:17,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 15:06:17,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:06:17,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 15:06:17,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 15:06:17,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 15:06:17,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 15:06:17,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 15:06:17,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 15:06:17,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 15:06:17,227 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:06:17,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 15:06:17,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 15:06:17,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 15:06:17,701 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 15:06:17,702 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 15:06:17,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2020-12-23 15:06:17,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d372346be/9824331b52e84fe1a6d3b292185a4295/FLAGff78cc407 [2020-12-23 15:06:18,756 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 15:06:18,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2020-12-23 15:06:18,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d372346be/9824331b52e84fe1a6d3b292185a4295/FLAGff78cc407 [2020-12-23 15:06:19,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d372346be/9824331b52e84fe1a6d3b292185a4295 [2020-12-23 15:06:19,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 15:06:19,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 15:06:19,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 15:06:19,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 15:06:19,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 15:06:19,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:06:19" (1/1) ... [2020-12-23 15:06:19,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1fa873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:19, skipping insertion in model container [2020-12-23 15:06:19,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:06:19" (1/1) ... [2020-12-23 15:06:19,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 15:06:19,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 15:06:19,849 WARN L1219 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2020-12-23 15:06:19,850 WARN L1219 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] 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[~tmp~3,] [2020-12-23 15:06:20,166 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],raw_lock],ldv_1458],head_tail] 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~4,] 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___1~0,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] 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___1~1,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] 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~7,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~signature~0,],[BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~7,],IntegerLiteral[4294967296]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] 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~2,] 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~8,] 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~9,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] 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~4,] 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~1,] 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: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~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~11,] 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~12,] 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[32],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],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~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~__wait~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] 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~14,] 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~15,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] 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~16,] 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~6,] 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~3,] 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~17,] 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~17,] 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~18,] 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~19,] 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~19,] 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~20,] 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[40],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[40],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[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~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___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_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___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_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~22,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] 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~24,] 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] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] 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:06:20,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:06:20,875 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 15:06:21,017 WARN L1219 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2020-12-23 15:06:21,018 WARN L1219 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] 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[~tmp~3,] [2020-12-23 15:06:21,056 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] 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~4,] 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___1~0,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] 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___1~1,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] 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~7,] 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~7,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] 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~2,] 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~8,] 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~9,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] 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~4,] 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~1,] 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: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~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~11,] 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~12,] 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[32],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],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~1,] 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~13,] 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~14,] 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~15,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] 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~16,] 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~6,] 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~3,] 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~17,] 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~17,] 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~18,] 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~19,] 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~19,] 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~20,] 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[40],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[40],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[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~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___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_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___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_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~22,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] 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~24,] 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] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] 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:06:21,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:06:21,536 INFO L208 MainTranslator]: Completed translation [2020-12-23 15:06:21,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21 WrapperNode [2020-12-23 15:06:21,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 15:06:21,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 15:06:21,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 15:06:21,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 15:06:21,552 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:06:21" (1/1) ... [2020-12-23 15:06:21,652 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:06:21" (1/1) ... [2020-12-23 15:06:21,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 15:06:21,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 15:06:21,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 15:06:21,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 15:06:21,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21" (1/1) ... [2020-12-23 15:06:21,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21" (1/1) ... [2020-12-23 15:06:21,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21" (1/1) ... [2020-12-23 15:06:21,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21" (1/1) ... [2020-12-23 15:06:21,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21" (1/1) ... [2020-12-23 15:06:22,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21" (1/1) ... [2020-12-23 15:06:22,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21" (1/1) ... [2020-12-23 15:06:22,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 15:06:22,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 15:06:22,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 15:06:22,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 15:06:22,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21" (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:06:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-12-23 15:06:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-12-23 15:06:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-23 15:06:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 15:06:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 15:06:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 15:06:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 15:06:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 15:06:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 15:06:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 15:06:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 15:06:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 15:06:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 15:06:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-12-23 15:06:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 15:06:22,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 15:06:31,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 15:06:31,112 INFO L299 CfgBuilder]: Removed 1042 assume(true) statements. [2020-12-23 15:06:31,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:06:31 BoogieIcfgContainer [2020-12-23 15:06:31,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 15:06:31,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 15:06:31,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 15:06:31,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 15:06:31,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:06:19" (1/3) ... [2020-12-23 15:06:31,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab80ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:06:31, skipping insertion in model container [2020-12-23 15:06:31,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:06:21" (2/3) ... [2020-12-23 15:06:31,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab80ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:06:31, skipping insertion in model container [2020-12-23 15:06:31,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:06:31" (3/3) ... [2020-12-23 15:06:31,130 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2020-12-23 15:06:31,137 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 15:06:31,143 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-12-23 15:06:31,164 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-23 15:06:31,201 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 15:06:31,201 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 15:06:31,201 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 15:06:31,201 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 15:06:31,202 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 15:06:31,202 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 15:06:31,202 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 15:06:31,202 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 15:06:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states. [2020-12-23 15:06:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 15:06:31,254 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:31,255 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] [2020-12-23 15:06:31,255 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:06:31,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:31,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1385985514, now seen corresponding path program 1 times [2020-12-23 15:06:31,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:31,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148175447] [2020-12-23 15:06:31,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:31,893 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:06:31,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148175447] [2020-12-23 15:06:31,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:31,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:06:31,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46842406] [2020-12-23 15:06:31,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 15:06:31,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:31,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 15:06:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 15:06:31,925 INFO L87 Difference]: Start difference. First operand 835 states. Second operand 2 states. [2020-12-23 15:06:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:32,100 INFO L93 Difference]: Finished difference Result 1667 states and 2311 transitions. [2020-12-23 15:06:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 15:06:32,101 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 62 [2020-12-23 15:06:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:32,136 INFO L225 Difference]: With dead ends: 1667 [2020-12-23 15:06:32,137 INFO L226 Difference]: Without dead ends: 823 [2020-12-23 15:06:32,150 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:06:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2020-12-23 15:06:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 823. [2020-12-23 15:06:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2020-12-23 15:06:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1122 transitions. [2020-12-23 15:06:32,285 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1122 transitions. Word has length 62 [2020-12-23 15:06:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:32,286 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 1122 transitions. [2020-12-23 15:06:32,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 15:06:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1122 transitions. [2020-12-23 15:06:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 15:06:32,300 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:32,300 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] [2020-12-23 15:06:32,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 15:06:32,301 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:06:32,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:32,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1732742655, now seen corresponding path program 1 times [2020-12-23 15:06:32,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:32,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131463505] [2020-12-23 15:06:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:32,532 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:06:32,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131463505] [2020-12-23 15:06:32,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:32,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:06:32,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073618243] [2020-12-23 15:06:32,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:06:32,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:32,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:06:32,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:06:32,539 INFO L87 Difference]: Start difference. First operand 823 states and 1122 transitions. Second operand 3 states. [2020-12-23 15:06:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:32,770 INFO L93 Difference]: Finished difference Result 1664 states and 2273 transitions. [2020-12-23 15:06:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:06:32,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-12-23 15:06:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:32,778 INFO L225 Difference]: With dead ends: 1664 [2020-12-23 15:06:32,778 INFO L226 Difference]: Without dead ends: 844 [2020-12-23 15:06:32,782 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:06:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2020-12-23 15:06:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 841. [2020-12-23 15:06:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2020-12-23 15:06:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1149 transitions. [2020-12-23 15:06:32,814 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1149 transitions. Word has length 63 [2020-12-23 15:06:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:32,815 INFO L481 AbstractCegarLoop]: Abstraction has 841 states and 1149 transitions. [2020-12-23 15:06:32,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:06:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1149 transitions. [2020-12-23 15:06:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 15:06:32,817 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:32,818 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] [2020-12-23 15:06:32,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 15:06:32,818 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:06:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2128587854, now seen corresponding path program 1 times [2020-12-23 15:06:32,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:32,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565840433] [2020-12-23 15:06:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:33,155 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:06:33,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565840433] [2020-12-23 15:06:33,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:33,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 15:06:33,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094531862] [2020-12-23 15:06:33,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:06:33,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:33,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:06:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:06:33,173 INFO L87 Difference]: Start difference. First operand 841 states and 1149 transitions. Second operand 6 states. [2020-12-23 15:06:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:34,082 INFO L93 Difference]: Finished difference Result 1769 states and 2432 transitions. [2020-12-23 15:06:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 15:06:34,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2020-12-23 15:06:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:34,091 INFO L225 Difference]: With dead ends: 1769 [2020-12-23 15:06:34,092 INFO L226 Difference]: Without dead ends: 931 [2020-12-23 15:06:34,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:06:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2020-12-23 15:06:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 901. [2020-12-23 15:06:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2020-12-23 15:06:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1239 transitions. [2020-12-23 15:06:34,137 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1239 transitions. Word has length 85 [2020-12-23 15:06:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:34,139 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1239 transitions. [2020-12-23 15:06:34,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:06:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1239 transitions. [2020-12-23 15:06:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 15:06:34,143 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:34,144 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] [2020-12-23 15:06:34,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 15:06:34,146 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:06:34,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:34,147 INFO L82 PathProgramCache]: Analyzing trace with hash 368041951, now seen corresponding path program 1 times [2020-12-23 15:06:34,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:34,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622659183] [2020-12-23 15:06:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:34,363 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:06:34,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622659183] [2020-12-23 15:06:34,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:34,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:06:34,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524911660] [2020-12-23 15:06:34,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:06:34,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:06:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:06:34,368 INFO L87 Difference]: Start difference. First operand 901 states and 1239 transitions. Second operand 3 states. [2020-12-23 15:06:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:34,474 INFO L93 Difference]: Finished difference Result 2695 states and 3708 transitions. [2020-12-23 15:06:34,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:06:34,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-12-23 15:06:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:34,485 INFO L225 Difference]: With dead ends: 2695 [2020-12-23 15:06:34,485 INFO L226 Difference]: Without dead ends: 1797 [2020-12-23 15:06:34,493 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:06:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2020-12-23 15:06:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 902. [2020-12-23 15:06:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2020-12-23 15:06:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1240 transitions. [2020-12-23 15:06:34,554 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1240 transitions. Word has length 99 [2020-12-23 15:06:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:34,554 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1240 transitions. [2020-12-23 15:06:34,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:06:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1240 transitions. [2020-12-23 15:06:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 15:06:34,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:34,562 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] [2020-12-23 15:06:34,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 15:06:34,562 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:06:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash -49354655, now seen corresponding path program 1 times [2020-12-23 15:06:34,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:34,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732763410] [2020-12-23 15:06:34,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:34,821 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:06:34,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732763410] [2020-12-23 15:06:34,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:34,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:06:34,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179136260] [2020-12-23 15:06:34,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:06:34,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:34,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:06:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:06:34,826 INFO L87 Difference]: Start difference. First operand 902 states and 1240 transitions. Second operand 4 states. [2020-12-23 15:06:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:34,989 INFO L93 Difference]: Finished difference Result 1986 states and 2748 transitions. [2020-12-23 15:06:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:06:34,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 15:06:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:34,998 INFO L225 Difference]: With dead ends: 1986 [2020-12-23 15:06:34,998 INFO L226 Difference]: Without dead ends: 1087 [2020-12-23 15:06:35,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:06:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2020-12-23 15:06:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 906. [2020-12-23 15:06:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2020-12-23 15:06:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1244 transitions. [2020-12-23 15:06:35,057 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1244 transitions. Word has length 99 [2020-12-23 15:06:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:35,057 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1244 transitions. [2020-12-23 15:06:35,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:06:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1244 transitions. [2020-12-23 15:06:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 15:06:35,060 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:35,060 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] [2020-12-23 15:06:35,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 15:06:35,060 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:06:35,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:35,061 INFO L82 PathProgramCache]: Analyzing trace with hash 899028749, now seen corresponding path program 1 times [2020-12-23 15:06:35,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:35,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229590525] [2020-12-23 15:06:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:35,335 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:06:35,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229590525] [2020-12-23 15:06:35,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:35,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:06:35,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121374471] [2020-12-23 15:06:35,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:06:35,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:35,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:06:35,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:06:35,338 INFO L87 Difference]: Start difference. First operand 906 states and 1244 transitions. Second operand 3 states. [2020-12-23 15:06:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:35,427 INFO L93 Difference]: Finished difference Result 1809 states and 2485 transitions. [2020-12-23 15:06:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:06:35,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 15:06:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:35,434 INFO L225 Difference]: With dead ends: 1809 [2020-12-23 15:06:35,434 INFO L226 Difference]: Without dead ends: 906 [2020-12-23 15:06:35,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:06:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-12-23 15:06:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2020-12-23 15:06:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2020-12-23 15:06:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1230 transitions. [2020-12-23 15:06:35,491 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1230 transitions. Word has length 107 [2020-12-23 15:06:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:35,491 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1230 transitions. [2020-12-23 15:06:35,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:06:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1230 transitions. [2020-12-23 15:06:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 15:06:35,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:35,494 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] [2020-12-23 15:06:35,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 15:06:35,494 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:06:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:35,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1716677199, now seen corresponding path program 1 times [2020-12-23 15:06:35,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:35,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888886849] [2020-12-23 15:06:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:35,666 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:06:35,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888886849] [2020-12-23 15:06:35,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:35,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:06:35,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121034106] [2020-12-23 15:06:35,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:06:35,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:35,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:06:35,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:06:35,668 INFO L87 Difference]: Start difference. First operand 906 states and 1230 transitions. Second operand 3 states. [2020-12-23 15:06:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:35,799 INFO L93 Difference]: Finished difference Result 1811 states and 2461 transitions. [2020-12-23 15:06:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:06:35,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 15:06:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:35,806 INFO L225 Difference]: With dead ends: 1811 [2020-12-23 15:06:35,806 INFO L226 Difference]: Without dead ends: 908 [2020-12-23 15:06:35,808 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:06:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2020-12-23 15:06:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2020-12-23 15:06:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2020-12-23 15:06:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1232 transitions. [2020-12-23 15:06:35,861 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1232 transitions. Word has length 107 [2020-12-23 15:06:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:35,862 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 1232 transitions. [2020-12-23 15:06:35,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:06:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1232 transitions. [2020-12-23 15:06:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 15:06:35,865 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:35,865 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] [2020-12-23 15:06:35,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 15:06:35,865 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:06:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1323650189, now seen corresponding path program 1 times [2020-12-23 15:06:35,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:35,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410902039] [2020-12-23 15:06:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:36,042 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:06:36,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410902039] [2020-12-23 15:06:36,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:36,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:06:36,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520139374] [2020-12-23 15:06:36,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:06:36,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:36,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:06:36,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:06:36,047 INFO L87 Difference]: Start difference. First operand 908 states and 1232 transitions. Second operand 3 states. [2020-12-23 15:06:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:36,544 INFO L93 Difference]: Finished difference Result 2628 states and 3582 transitions. [2020-12-23 15:06:36,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:06:36,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 15:06:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:36,555 INFO L225 Difference]: With dead ends: 2628 [2020-12-23 15:06:36,555 INFO L226 Difference]: Without dead ends: 1723 [2020-12-23 15:06:36,559 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:06:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2020-12-23 15:06:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 914. [2020-12-23 15:06:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2020-12-23 15:06:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1238 transitions. [2020-12-23 15:06:36,625 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1238 transitions. Word has length 107 [2020-12-23 15:06:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:36,625 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 1238 transitions. [2020-12-23 15:06:36,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:06:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1238 transitions. [2020-12-23 15:06:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 15:06:36,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:36,628 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] [2020-12-23 15:06:36,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 15:06:36,628 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:06:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash 600820308, now seen corresponding path program 1 times [2020-12-23 15:06:36,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:36,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996077070] [2020-12-23 15:06:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:36,804 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:06:36,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996077070] [2020-12-23 15:06:36,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232927293] [2020-12-23 15:06:36,811 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:06:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:37,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:06:37,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:37,476 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:06:37,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:06:37,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 15:06:37,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697671490] [2020-12-23 15:06:37,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:06:37,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:37,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:06:37,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:06:37,478 INFO L87 Difference]: Start difference. First operand 914 states and 1238 transitions. Second operand 3 states. [2020-12-23 15:06:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:37,746 INFO L93 Difference]: Finished difference Result 2610 states and 3564 transitions. [2020-12-23 15:06:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:06:37,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-12-23 15:06:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:37,756 INFO L225 Difference]: With dead ends: 2610 [2020-12-23 15:06:37,756 INFO L226 Difference]: Without dead ends: 1699 [2020-12-23 15:06:37,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 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:06:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2020-12-23 15:06:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 950. [2020-12-23 15:06:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-12-23 15:06:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1286 transitions. [2020-12-23 15:06:37,830 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1286 transitions. Word has length 111 [2020-12-23 15:06:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:37,830 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 1286 transitions. [2020-12-23 15:06:37,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:06:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1286 transitions. [2020-12-23 15:06:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 15:06:37,833 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:37,833 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] [2020-12-23 15:06:38,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-23 15:06:38,050 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:06:38,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash -839010496, now seen corresponding path program 1 times [2020-12-23 15:06:38,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:38,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753882399] [2020-12-23 15:06:38,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:38,278 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:06:38,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753882399] [2020-12-23 15:06:38,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009612615] [2020-12-23 15:06:38,279 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:06:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:38,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:06:38,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 15:06:39,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:06:39,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2020-12-23 15:06:39,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905193009] [2020-12-23 15:06:39,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:06:39,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:39,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:06:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:06:39,103 INFO L87 Difference]: Start difference. First operand 950 states and 1286 transitions. Second operand 5 states. [2020-12-23 15:06:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:39,623 INFO L93 Difference]: Finished difference Result 1900 states and 2573 transitions. [2020-12-23 15:06:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:06:39,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2020-12-23 15:06:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:39,630 INFO L225 Difference]: With dead ends: 1900 [2020-12-23 15:06:39,630 INFO L226 Difference]: Without dead ends: 948 [2020-12-23 15:06:39,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 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:06:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-12-23 15:06:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2020-12-23 15:06:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2020-12-23 15:06:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1283 transitions. [2020-12-23 15:06:39,744 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1283 transitions. Word has length 116 [2020-12-23 15:06:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:39,744 INFO L481 AbstractCegarLoop]: Abstraction has 948 states and 1283 transitions. [2020-12-23 15:06:39,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:06:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1283 transitions. [2020-12-23 15:06:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 15:06:39,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:39,747 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] [2020-12-23 15:06:39,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 15:06:39,963 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:06:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1898073031, now seen corresponding path program 1 times [2020-12-23 15:06:39,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:39,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365423627] [2020-12-23 15:06:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:40,192 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:06:40,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365423627] [2020-12-23 15:06:40,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100918543] [2020-12-23 15:06:40,193 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:06:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:40,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 1707 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:06:40,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:40,882 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:06:40,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:06:40,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 15:06:40,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203048174] [2020-12-23 15:06:40,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:06:40,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:06:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:06:40,884 INFO L87 Difference]: Start difference. First operand 948 states and 1283 transitions. Second operand 5 states. [2020-12-23 15:06:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:41,789 INFO L93 Difference]: Finished difference Result 3549 states and 4829 transitions. [2020-12-23 15:06:41,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:06:41,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2020-12-23 15:06:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:41,810 INFO L225 Difference]: With dead ends: 3549 [2020-12-23 15:06:41,810 INFO L226 Difference]: Without dead ends: 2604 [2020-12-23 15:06:41,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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:06:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2020-12-23 15:06:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1014. [2020-12-23 15:06:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2020-12-23 15:06:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1361 transitions. [2020-12-23 15:06:41,925 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1361 transitions. Word has length 116 [2020-12-23 15:06:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:41,925 INFO L481 AbstractCegarLoop]: Abstraction has 1014 states and 1361 transitions. [2020-12-23 15:06:41,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:06:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1361 transitions. [2020-12-23 15:06:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 15:06:41,929 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:41,929 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:06:42,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-23 15:06:42,144 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:06:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1070580320, now seen corresponding path program 1 times [2020-12-23 15:06:42,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:42,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440636250] [2020-12-23 15:06:42,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:42,360 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:06:42,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440636250] [2020-12-23 15:06:42,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:06:42,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:06:42,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256203418] [2020-12-23 15:06:42,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:06:42,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:42,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:06:42,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:06:42,363 INFO L87 Difference]: Start difference. First operand 1014 states and 1361 transitions. Second operand 4 states. [2020-12-23 15:06:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:42,558 INFO L93 Difference]: Finished difference Result 2208 states and 2979 transitions. [2020-12-23 15:06:42,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:06:42,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2020-12-23 15:06:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:42,565 INFO L225 Difference]: With dead ends: 2208 [2020-12-23 15:06:42,565 INFO L226 Difference]: Without dead ends: 1197 [2020-12-23 15:06:42,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:06:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-12-23 15:06:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1014. [2020-12-23 15:06:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2020-12-23 15:06:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1361 transitions. [2020-12-23 15:06:42,661 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1361 transitions. Word has length 120 [2020-12-23 15:06:42,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:42,662 INFO L481 AbstractCegarLoop]: Abstraction has 1014 states and 1361 transitions. [2020-12-23 15:06:42,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:06:42,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1361 transitions. [2020-12-23 15:06:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 15:06:42,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:42,665 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] [2020-12-23 15:06:42,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 15:06:42,667 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:06:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash 719046718, now seen corresponding path program 1 times [2020-12-23 15:06:42,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:42,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736450647] [2020-12-23 15:06:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:42,958 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:06:42,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736450647] [2020-12-23 15:06:42,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337242284] [2020-12-23 15:06:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:43,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:06:43,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:43,590 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:06:43,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:06:43,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 15:06:43,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633206097] [2020-12-23 15:06:43,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:06:43,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:43,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:06:43,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:06:43,595 INFO L87 Difference]: Start difference. First operand 1014 states and 1361 transitions. Second operand 6 states. [2020-12-23 15:06:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:44,687 INFO L93 Difference]: Finished difference Result 4458 states and 6055 transitions. [2020-12-23 15:06:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:06:44,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2020-12-23 15:06:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:44,707 INFO L225 Difference]: With dead ends: 4458 [2020-12-23 15:06:44,707 INFO L226 Difference]: Without dead ends: 3447 [2020-12-23 15:06:44,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:06:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2020-12-23 15:06:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 1098. [2020-12-23 15:06:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2020-12-23 15:06:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1469 transitions. [2020-12-23 15:06:44,848 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1469 transitions. Word has length 121 [2020-12-23 15:06:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:44,849 INFO L481 AbstractCegarLoop]: Abstraction has 1098 states and 1469 transitions. [2020-12-23 15:06:44,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:06:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1469 transitions. [2020-12-23 15:06:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-23 15:06:44,852 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:44,854 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] [2020-12-23 15:06:45,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:45,070 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:06:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1324886871, now seen corresponding path program 2 times [2020-12-23 15:06:45,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:45,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278206961] [2020-12-23 15:06:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:45,356 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:06:45,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278206961] [2020-12-23 15:06:45,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538999787] [2020-12-23 15:06:45,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:46,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:06:46,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:06:46,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:06:46,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:46,572 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:06:46,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:06:46,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-12-23 15:06:46,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682848651] [2020-12-23 15:06:46,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:06:46,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:46,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:06:46,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:06:46,575 INFO L87 Difference]: Start difference. First operand 1098 states and 1469 transitions. Second operand 3 states. [2020-12-23 15:06:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:46,694 INFO L93 Difference]: Finished difference Result 2197 states and 2941 transitions. [2020-12-23 15:06:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:06:46,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-12-23 15:06:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:46,700 INFO L225 Difference]: With dead ends: 2197 [2020-12-23 15:06:46,700 INFO L226 Difference]: Without dead ends: 1102 [2020-12-23 15:06:46,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:06:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2020-12-23 15:06:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2020-12-23 15:06:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2020-12-23 15:06:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1473 transitions. [2020-12-23 15:06:46,808 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1473 transitions. Word has length 125 [2020-12-23 15:06:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:46,809 INFO L481 AbstractCegarLoop]: Abstraction has 1102 states and 1473 transitions. [2020-12-23 15:06:46,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:06:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1473 transitions. [2020-12-23 15:06:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-23 15:06:46,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:46,813 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:06:47,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 15:06:47,027 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:06:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash 935585522, now seen corresponding path program 1 times [2020-12-23 15:06:47,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:47,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486611263] [2020-12-23 15:06:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 15:06:47,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486611263] [2020-12-23 15:06:47,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898359795] [2020-12-23 15:06:47,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:47,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 1740 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:06:47,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 15:06:47,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:06:47,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-12-23 15:06:47,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175144030] [2020-12-23 15:06:47,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:06:47,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:47,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:06:47,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:06:47,992 INFO L87 Difference]: Start difference. First operand 1102 states and 1473 transitions. Second operand 7 states. [2020-12-23 15:06:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:49,458 INFO L93 Difference]: Finished difference Result 5409 states and 7335 transitions. [2020-12-23 15:06:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:06:49,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2020-12-23 15:06:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:49,485 INFO L225 Difference]: With dead ends: 5409 [2020-12-23 15:06:49,485 INFO L226 Difference]: Without dead ends: 4310 [2020-12-23 15:06:49,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:06:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2020-12-23 15:06:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 1186. [2020-12-23 15:06:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2020-12-23 15:06:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1581 transitions. [2020-12-23 15:06:49,619 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1581 transitions. Word has length 127 [2020-12-23 15:06:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:49,620 INFO L481 AbstractCegarLoop]: Abstraction has 1186 states and 1581 transitions. [2020-12-23 15:06:49,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:06:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1581 transitions. [2020-12-23 15:06:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 15:06:49,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:49,623 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] [2020-12-23 15:06:49,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:49,837 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:06:49,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1485426699, now seen corresponding path program 2 times [2020-12-23 15:06:49,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:49,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273586579] [2020-12-23 15:06:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:50,082 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:06:50,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273586579] [2020-12-23 15:06:50,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80214103] [2020-12-23 15:06:50,085 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:50,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:06:50,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:06:50,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:06:50,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-12-23 15:06:51,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:06:51,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2020-12-23 15:06:51,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925231408] [2020-12-23 15:06:51,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:06:51,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:51,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:06:51,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:06:51,143 INFO L87 Difference]: Start difference. First operand 1186 states and 1581 transitions. Second operand 3 states. [2020-12-23 15:06:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:51,312 INFO L93 Difference]: Finished difference Result 2514 states and 3367 transitions. [2020-12-23 15:06:51,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:06:51,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-12-23 15:06:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:51,320 INFO L225 Difference]: With dead ends: 2514 [2020-12-23 15:06:51,320 INFO L226 Difference]: Without dead ends: 1331 [2020-12-23 15:06:51,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 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:06:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2020-12-23 15:06:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1188. [2020-12-23 15:06:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2020-12-23 15:06:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1583 transitions. [2020-12-23 15:06:51,442 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1583 transitions. Word has length 131 [2020-12-23 15:06:51,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:51,442 INFO L481 AbstractCegarLoop]: Abstraction has 1188 states and 1583 transitions. [2020-12-23 15:06:51,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:06:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1583 transitions. [2020-12-23 15:06:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 15:06:51,446 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:51,446 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] [2020-12-23 15:06:51,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 15:06:51,660 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:06:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1562327497, now seen corresponding path program 1 times [2020-12-23 15:06:51,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:51,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684556081] [2020-12-23 15:06:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:51,889 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:06:51,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684556081] [2020-12-23 15:06:51,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250973687] [2020-12-23 15:06:51,890 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 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:06:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:52,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 15:06:52,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:52,546 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:06:52,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:06:52,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-23 15:06:52,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817737557] [2020-12-23 15:06:52,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:06:52,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:52,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:06:52,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:06:52,549 INFO L87 Difference]: Start difference. First operand 1188 states and 1583 transitions. Second operand 8 states. [2020-12-23 15:06:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:54,001 INFO L93 Difference]: Finished difference Result 6270 states and 8501 transitions. [2020-12-23 15:06:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:06:54,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 131 [2020-12-23 15:06:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:54,018 INFO L225 Difference]: With dead ends: 6270 [2020-12-23 15:06:54,018 INFO L226 Difference]: Without dead ends: 5085 [2020-12-23 15:06:54,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 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:06:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2020-12-23 15:06:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 1272. [2020-12-23 15:06:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2020-12-23 15:06:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1691 transitions. [2020-12-23 15:06:54,263 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1691 transitions. Word has length 131 [2020-12-23 15:06:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:54,264 INFO L481 AbstractCegarLoop]: Abstraction has 1272 states and 1691 transitions. [2020-12-23 15:06:54,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:06:54,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1691 transitions. [2020-12-23 15:06:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 15:06:54,279 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:54,279 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] [2020-12-23 15:06:54,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 15:06:54,490 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:06:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:54,492 INFO L82 PathProgramCache]: Analyzing trace with hash -406724766, now seen corresponding path program 2 times [2020-12-23 15:06:54,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:54,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396641229] [2020-12-23 15:06:54,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:54,745 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:06:54,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396641229] [2020-12-23 15:06:54,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875540414] [2020-12-23 15:06:54,747 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 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:06:55,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:06:55,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:06:55,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:06:55,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:55,632 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:06:55,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:06:55,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2020-12-23 15:06:55,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552259852] [2020-12-23 15:06:55,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:06:55,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:06:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:06:55,634 INFO L87 Difference]: Start difference. First operand 1272 states and 1691 transitions. Second operand 4 states. [2020-12-23 15:06:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:55,906 INFO L93 Difference]: Finished difference Result 2957 states and 3965 transitions. [2020-12-23 15:06:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:06:55,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2020-12-23 15:06:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:55,912 INFO L225 Difference]: With dead ends: 2957 [2020-12-23 15:06:55,913 INFO L226 Difference]: Without dead ends: 1688 [2020-12-23 15:06:55,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:06:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2020-12-23 15:06:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1276. [2020-12-23 15:06:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2020-12-23 15:06:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1695 transitions. [2020-12-23 15:06:56,048 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1695 transitions. Word has length 135 [2020-12-23 15:06:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:56,049 INFO L481 AbstractCegarLoop]: Abstraction has 1276 states and 1695 transitions. [2020-12-23 15:06:56,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:06:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1695 transitions. [2020-12-23 15:06:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-23 15:06:56,053 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:56,053 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] [2020-12-23 15:06:56,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 15:06:56,267 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:06:56,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1721218688, now seen corresponding path program 1 times [2020-12-23 15:06:56,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:56,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013147124] [2020-12-23 15:06:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:56,559 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:06:56,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013147124] [2020-12-23 15:06:56,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781096808] [2020-12-23 15:06:56,560 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 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:06:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:58,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 1775 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 15:06:58,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:06:58,234 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:06:58,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:06:58,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 15:06:58,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934828772] [2020-12-23 15:06:58,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:06:58,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:06:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:06:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:06:58,239 INFO L87 Difference]: Start difference. First operand 1276 states and 1695 transitions. Second operand 5 states. [2020-12-23 15:06:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:06:58,360 INFO L93 Difference]: Finished difference Result 2553 states and 3393 transitions. [2020-12-23 15:06:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:06:58,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2020-12-23 15:06:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:06:58,363 INFO L225 Difference]: With dead ends: 2553 [2020-12-23 15:06:58,364 INFO L226 Difference]: Without dead ends: 1280 [2020-12-23 15:06:58,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 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:06:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2020-12-23 15:06:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2020-12-23 15:06:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2020-12-23 15:06:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1699 transitions. [2020-12-23 15:06:58,499 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1699 transitions. Word has length 138 [2020-12-23 15:06:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:06:58,499 INFO L481 AbstractCegarLoop]: Abstraction has 1280 states and 1699 transitions. [2020-12-23 15:06:58,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:06:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1699 transitions. [2020-12-23 15:06:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:06:58,503 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:06:58,503 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] [2020-12-23 15:06:58,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:06:58,718 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:06:58,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:06:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash 591195845, now seen corresponding path program 2 times [2020-12-23 15:06:58,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:06:58,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319214974] [2020-12-23 15:06:58,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:06:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:06:58,975 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:06:58,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319214974] [2020-12-23 15:06:58,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196600723] [2020-12-23 15:06:58,976 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 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:07:17,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:07:17,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:07:17,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 1782 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 15:07:17,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:07:17,234 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:07:17,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:07:17,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 15:07:17,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071532903] [2020-12-23 15:07:17,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:07:17,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:07:17,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:07:17,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:07:17,236 INFO L87 Difference]: Start difference. First operand 1280 states and 1699 transitions. Second operand 6 states. [2020-12-23 15:07:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:07:17,423 INFO L93 Difference]: Finished difference Result 2561 states and 3401 transitions. [2020-12-23 15:07:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:07:17,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2020-12-23 15:07:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:07:17,427 INFO L225 Difference]: With dead ends: 2561 [2020-12-23 15:07:17,427 INFO L226 Difference]: Without dead ends: 1284 [2020-12-23 15:07:17,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 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:07:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2020-12-23 15:07:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2020-12-23 15:07:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2020-12-23 15:07:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1703 transitions. [2020-12-23 15:07:17,567 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1703 transitions. Word has length 140 [2020-12-23 15:07:17,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:07:17,568 INFO L481 AbstractCegarLoop]: Abstraction has 1284 states and 1703 transitions. [2020-12-23 15:07:17,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:07:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1703 transitions. [2020-12-23 15:07:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 15:07:17,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:07:17,572 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] [2020-12-23 15:07:17,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:07:17,773 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:07:17,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:07:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1265969610, now seen corresponding path program 3 times [2020-12-23 15:07:17,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:07:17,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172844492] [2020-12-23 15:07:17,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:07:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:07:18,000 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:07:18,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172844492] [2020-12-23 15:07:18,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711816806] [2020-12-23 15:07:18,001 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 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:08:44,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-12-23 15:08:44,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:08:44,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 1769 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:08:44,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:08:44,683 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:08:44,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:08:44,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-12-23 15:08:44,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206148116] [2020-12-23 15:08:44,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:08:44,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:08:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:08:44,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:08:44,685 INFO L87 Difference]: Start difference. First operand 1284 states and 1703 transitions. Second operand 7 states. [2020-12-23 15:08:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:08:44,859 INFO L93 Difference]: Finished difference Result 2569 states and 3409 transitions. [2020-12-23 15:08:44,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:08:44,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2020-12-23 15:08:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:08:44,863 INFO L225 Difference]: With dead ends: 2569 [2020-12-23 15:08:44,863 INFO L226 Difference]: Without dead ends: 1288 [2020-12-23 15:08:44,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:08:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2020-12-23 15:08:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1288. [2020-12-23 15:08:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2020-12-23 15:08:44,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1707 transitions. [2020-12-23 15:08:44,988 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1707 transitions. Word has length 142 [2020-12-23 15:08:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:08:44,988 INFO L481 AbstractCegarLoop]: Abstraction has 1288 states and 1707 transitions. [2020-12-23 15:08:44,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:08:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1707 transitions. [2020-12-23 15:08:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 15:08:44,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:08:44,992 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:08:45,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:08:45,206 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:08:45,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:08:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1183496079, now seen corresponding path program 4 times [2020-12-23 15:08:45,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:08:45,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932340582] [2020-12-23 15:08:45,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:08:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:08:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:08:45,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932340582] [2020-12-23 15:08:45,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150956807] [2020-12-23 15:08:45,420 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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:08:46,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 15:08:46,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:08:46,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 1796 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 15:08:46,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:08:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:08:46,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:08:46,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-23 15:08:46,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757884179] [2020-12-23 15:08:46,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:08:46,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:08:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:08:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:08:46,661 INFO L87 Difference]: Start difference. First operand 1288 states and 1707 transitions. Second operand 8 states. [2020-12-23 15:08:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:08:46,860 INFO L93 Difference]: Finished difference Result 2577 states and 3417 transitions. [2020-12-23 15:08:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:08:46,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 144 [2020-12-23 15:08:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:08:46,865 INFO L225 Difference]: With dead ends: 2577 [2020-12-23 15:08:46,865 INFO L226 Difference]: Without dead ends: 1292 [2020-12-23 15:08:46,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:08:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2020-12-23 15:08:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2020-12-23 15:08:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2020-12-23 15:08:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1711 transitions. [2020-12-23 15:08:46,986 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1711 transitions. Word has length 144 [2020-12-23 15:08:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:08:46,987 INFO L481 AbstractCegarLoop]: Abstraction has 1292 states and 1711 transitions. [2020-12-23 15:08:46,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:08:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1711 transitions. [2020-12-23 15:08:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-23 15:08:46,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:08:46,990 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:08:47,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-23 15:08:47,204 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:08:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:08:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash -764155884, now seen corresponding path program 5 times [2020-12-23 15:08:47,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:08:47,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100373820] [2020-12-23 15:08:47,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:08:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:08:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:08:47,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100373820] [2020-12-23 15:08:47,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019404896] [2020-12-23 15:08:47,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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:08:52,586 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-12-23 15:08:52,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:08:52,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 1803 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-23 15:08:52,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:08:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:08:52,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:08:52,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-12-23 15:08:52,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327428347] [2020-12-23 15:08:52,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 15:08:52,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:08:52,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 15:08:52,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:08:52,717 INFO L87 Difference]: Start difference. First operand 1292 states and 1711 transitions. Second operand 9 states. [2020-12-23 15:08:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:08:52,904 INFO L93 Difference]: Finished difference Result 2585 states and 3425 transitions. [2020-12-23 15:08:52,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 15:08:52,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2020-12-23 15:08:52,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:08:52,907 INFO L225 Difference]: With dead ends: 2585 [2020-12-23 15:08:52,907 INFO L226 Difference]: Without dead ends: 1296 [2020-12-23 15:08:52,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:08:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2020-12-23 15:08:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2020-12-23 15:08:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2020-12-23 15:08:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1715 transitions. [2020-12-23 15:08:53,074 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1715 transitions. Word has length 146 [2020-12-23 15:08:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:08:53,074 INFO L481 AbstractCegarLoop]: Abstraction has 1296 states and 1715 transitions. [2020-12-23 15:08:53,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 15:08:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1715 transitions. [2020-12-23 15:08:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 15:08:53,078 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:08:53,078 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:08:53,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:08:53,290 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:08:53,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:08:53,291 INFO L82 PathProgramCache]: Analyzing trace with hash 148048729, now seen corresponding path program 6 times [2020-12-23 15:08:53,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:08:53,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321102270] [2020-12-23 15:08:53,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:08:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:08:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 15:08:53,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321102270] [2020-12-23 15:08:53,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464785468] [2020-12-23 15:08:53,549 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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