./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:21:36,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:21:36,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 21:21:36,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:21:36,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:21:36,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:21:36,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:21:36,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:21:36,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:21:36,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:21:36,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:21:36,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:21:36,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:21:36,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:21:36,418 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:21:36,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:21:36,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:21:36,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:21:36,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:21:36,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:21:36,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:21:36,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:21:36,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:21:36,423 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:21:36,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:21:36,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:21:36,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:21:36,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:21:36,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:21:36,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:21:36,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:21:36,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:21:36,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:21:36,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:21:36,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:21:36,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:21:36,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:21:36,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:21:36,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:21:36,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:21:36,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:21:36,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf [2024-10-11 21:21:36,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:21:36,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:21:36,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:21:36,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:21:36,663 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:21:36,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-10-11 21:21:38,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:21:38,370 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:21:38,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-10-11 21:21:38,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2d1ed9110/62886dae07514ddf8e72a7d8d13025fe/FLAGa5117660b [2024-10-11 21:21:38,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2d1ed9110/62886dae07514ddf8e72a7d8d13025fe [2024-10-11 21:21:38,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:21:38,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:21:38,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:21:38,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:21:38,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:21:38,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:21:38" (1/1) ... [2024-10-11 21:21:38,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3476b86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:38, skipping insertion in model container [2024-10-11 21:21:38,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:21:38" (1/1) ... [2024-10-11 21:21:38,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:21:38,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:21:38,961 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:21:39,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:21:39,214 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:21:39,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39 WrapperNode [2024-10-11 21:21:39,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:21:39,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:21:39,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:21:39,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:21:39,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,307 INFO L138 Inliner]: procedures = 99, calls = 349, calls flagged for inlining = 41, calls inlined = 33, statements flattened = 799 [2024-10-11 21:21:39,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:21:39,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:21:39,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:21:39,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:21:39,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,392 INFO L175 MemorySlicer]: Split 221 memory accesses to 6 slices as follows [2, 12, 63, 14, 100, 30]. 45 percent of accesses are in the largest equivalence class. The 195 initializations are split as follows [2, 0, 63, 0, 100, 30]. The 14 writes are split as follows [0, 12, 0, 2, 0, 0]. [2024-10-11 21:21:39,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:21:39,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:21:39,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:21:39,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:21:39,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:21:39,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:39,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:21:39,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:21:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2024-10-11 21:21:39,542 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2024-10-11 21:21:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 21:21:39,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 21:21:39,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 21:21:39,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 21:21:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 21:21:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 21:21:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 21:21:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 21:21:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-10-11 21:21:39,544 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-10-11 21:21:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 21:21:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 21:21:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2024-10-11 21:21:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2024-10-11 21:21:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 21:21:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-10-11 21:21:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-10-11 21:21:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:21:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 21:21:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 21:21:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 21:21:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 21:21:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 21:21:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 21:21:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 21:21:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 21:21:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 21:21:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 21:21:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 21:21:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 21:21:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 21:21:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2024-10-11 21:21:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2024-10-11 21:21:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 21:21:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-10-11 21:21:39,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-10-11 21:21:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 21:21:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 21:21:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 21:21:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 21:21:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 21:21:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 21:21:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 21:21:39,551 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 21:21:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:21:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 21:21:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 21:21:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 21:21:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 21:21:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 21:21:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-10-11 21:21:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-10-11 21:21:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:21:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:21:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-11 21:21:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-11 21:21:39,789 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:21:39,791 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:21:40,461 INFO L? ?]: Removed 269 outVars from TransFormulas that were not future-live. [2024-10-11 21:21:40,462 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:21:40,583 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:21:40,583 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 21:21:40,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:40 BoogieIcfgContainer [2024-10-11 21:21:40,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:21:40,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:21:40,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:21:40,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:21:40,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:21:38" (1/3) ... [2024-10-11 21:21:40,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8a8598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:21:40, skipping insertion in model container [2024-10-11 21:21:40,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39" (2/3) ... [2024-10-11 21:21:40,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8a8598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:21:40, skipping insertion in model container [2024-10-11 21:21:40,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:40" (3/3) ... [2024-10-11 21:21:40,590 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-10-11 21:21:40,601 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:21:40,601 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-11 21:21:40,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:21:40,667 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@44a54a07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:21:40,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 21:21:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 107 states have (on average 1.5981308411214954) internal successors, (171), 124 states have internal predecessors, (171), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 21:21:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 21:21:40,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:40,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:40,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:40,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash -948582716, now seen corresponding path program 1 times [2024-10-11 21:21:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:40,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457100126] [2024-10-11 21:21:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:40,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:21:41,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:41,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457100126] [2024-10-11 21:21:41,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457100126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:41,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:41,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:21:41,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618769836] [2024-10-11 21:21:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:41,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:21:41,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:41,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:21:41,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:21:41,041 INFO L87 Difference]: Start difference. First operand has 158 states, 107 states have (on average 1.5981308411214954) internal successors, (171), 124 states have internal predecessors, (171), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:21:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:41,235 INFO L93 Difference]: Finished difference Result 415 states and 626 transitions. [2024-10-11 21:21:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:21:41,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 21:21:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:41,245 INFO L225 Difference]: With dead ends: 415 [2024-10-11 21:21:41,245 INFO L226 Difference]: Without dead ends: 228 [2024-10-11 21:21:41,248 INFO L431 NwaCegarLoop]: 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 [2024-10-11 21:21:41,250 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 140 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:41,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 360 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-11 21:21:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-10-11 21:21:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 160 states have (on average 1.5125) internal successors, (242), 170 states have internal predecessors, (242), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 21:21:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 320 transitions. [2024-10-11 21:21:41,293 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 320 transitions. Word has length 12 [2024-10-11 21:21:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:41,294 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 320 transitions. [2024-10-11 21:21:41,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:21:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 320 transitions. [2024-10-11 21:21:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 21:21:41,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:41,296 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:41,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:21:41,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:41,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash 971389165, now seen corresponding path program 1 times [2024-10-11 21:21:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:41,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268364214] [2024-10-11 21:21:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:21:41,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268364214] [2024-10-11 21:21:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268364214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:41,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:41,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 21:21:41,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947958437] [2024-10-11 21:21:41,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:41,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:21:41,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:41,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:21:41,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:21:41,439 INFO L87 Difference]: Start difference. First operand 228 states and 320 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:21:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:41,596 INFO L93 Difference]: Finished difference Result 455 states and 639 transitions. [2024-10-11 21:21:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:21:41,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 21:21:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:41,600 INFO L225 Difference]: With dead ends: 455 [2024-10-11 21:21:41,600 INFO L226 Difference]: Without dead ends: 451 [2024-10-11 21:21:41,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:21:41,601 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 173 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:41,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 314 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-11 21:21:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 445. [2024-10-11 21:21:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 319 states have (on average 1.5015673981191222) internal successors, (479), 330 states have internal predecessors, (479), 78 states have call successors, (78), 38 states have call predecessors, (78), 38 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 21:21:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 635 transitions. [2024-10-11 21:21:41,630 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 635 transitions. Word has length 21 [2024-10-11 21:21:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:41,630 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 635 transitions. [2024-10-11 21:21:41,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:21:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 635 transitions. [2024-10-11 21:21:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 21:21:41,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:41,632 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:41,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:21:41,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:41,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash -494808822, now seen corresponding path program 1 times [2024-10-11 21:21:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:41,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471201053] [2024-10-11 21:21:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:21:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 21:21:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:21:41,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:41,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471201053] [2024-10-11 21:21:41,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471201053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:41,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:41,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:21:41,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615646371] [2024-10-11 21:21:41,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:41,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:41,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:41,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:41,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:41,720 INFO L87 Difference]: Start difference. First operand 445 states and 635 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:21:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:42,043 INFO L93 Difference]: Finished difference Result 995 states and 1420 transitions. [2024-10-11 21:21:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-11 21:21:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:42,048 INFO L225 Difference]: With dead ends: 995 [2024-10-11 21:21:42,048 INFO L226 Difference]: Without dead ends: 551 [2024-10-11 21:21:42,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:42,050 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 173 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:42,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 519 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-11 21:21:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 531. [2024-10-11 21:21:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 381 states have (on average 1.4855643044619422) internal successors, (566), 392 states have internal predecessors, (566), 92 states have call successors, (92), 48 states have call predecessors, (92), 48 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 21:21:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 750 transitions. [2024-10-11 21:21:42,078 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 750 transitions. Word has length 27 [2024-10-11 21:21:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:42,079 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 750 transitions. [2024-10-11 21:21:42,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:21:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 750 transitions. [2024-10-11 21:21:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 21:21:42,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:42,081 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:42,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:21:42,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:42,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:42,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2123508235, now seen corresponding path program 1 times [2024-10-11 21:21:42,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:42,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436396184] [2024-10-11 21:21:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 21:21:42,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:42,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436396184] [2024-10-11 21:21:42,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436396184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:42,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:42,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:21:42,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881373501] [2024-10-11 21:21:42,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:42,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:42,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:42,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:42,242 INFO L87 Difference]: Start difference. First operand 531 states and 750 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:21:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:42,541 INFO L93 Difference]: Finished difference Result 1102 states and 1556 transitions. [2024-10-11 21:21:42,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:42,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 21:21:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:42,546 INFO L225 Difference]: With dead ends: 1102 [2024-10-11 21:21:42,546 INFO L226 Difference]: Without dead ends: 779 [2024-10-11 21:21:42,547 INFO L431 NwaCegarLoop]: 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 [2024-10-11 21:21:42,548 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 173 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:42,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 765 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-11 21:21:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 535. [2024-10-11 21:21:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 396 states have internal predecessors, (570), 92 states have call successors, (92), 48 states have call predecessors, (92), 48 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 21:21:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 754 transitions. [2024-10-11 21:21:42,595 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 754 transitions. Word has length 33 [2024-10-11 21:21:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:42,596 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 754 transitions. [2024-10-11 21:21:42,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:21:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 754 transitions. [2024-10-11 21:21:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 21:21:42,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:42,598 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:42,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:21:42,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:42,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash -242785440, now seen corresponding path program 1 times [2024-10-11 21:21:42,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:42,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814275355] [2024-10-11 21:21:42,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:42,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:21:42,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:42,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814275355] [2024-10-11 21:21:42,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814275355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:42,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:42,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:42,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412126296] [2024-10-11 21:21:42,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:42,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:42,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:42,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:42,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:42,742 INFO L87 Difference]: Start difference. First operand 535 states and 754 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:21:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:43,035 INFO L93 Difference]: Finished difference Result 1030 states and 1465 transitions. [2024-10-11 21:21:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:43,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-10-11 21:21:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:43,039 INFO L225 Difference]: With dead ends: 1030 [2024-10-11 21:21:43,040 INFO L226 Difference]: Without dead ends: 583 [2024-10-11 21:21:43,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:43,044 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 21 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:43,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 383 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-11 21:21:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 563. [2024-10-11 21:21:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 407 states have (on average 1.4594594594594594) internal successors, (594), 418 states have internal predecessors, (594), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 21:21:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 790 transitions. [2024-10-11 21:21:43,080 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 790 transitions. Word has length 40 [2024-10-11 21:21:43,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:43,080 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 790 transitions. [2024-10-11 21:21:43,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:21:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 790 transitions. [2024-10-11 21:21:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 21:21:43,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:43,083 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:43,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:21:43,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1735446132, now seen corresponding path program 1 times [2024-10-11 21:21:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757356601] [2024-10-11 21:21:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 21:21:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:21:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757356601] [2024-10-11 21:21:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757356601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:43,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:43,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:21:43,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541394694] [2024-10-11 21:21:43,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:43,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:43,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:43,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:43,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:43,360 INFO L87 Difference]: Start difference. First operand 563 states and 790 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 21:21:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:43,742 INFO L93 Difference]: Finished difference Result 1060 states and 1493 transitions. [2024-10-11 21:21:43,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:43,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2024-10-11 21:21:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:43,745 INFO L225 Difference]: With dead ends: 1060 [2024-10-11 21:21:43,745 INFO L226 Difference]: Without dead ends: 585 [2024-10-11 21:21:43,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:43,749 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:43,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 511 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:21:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-11 21:21:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 565. [2024-10-11 21:21:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 409 states have (on average 1.4572127139364304) internal successors, (596), 420 states have internal predecessors, (596), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 21:21:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 792 transitions. [2024-10-11 21:21:43,776 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 792 transitions. Word has length 50 [2024-10-11 21:21:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:43,777 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 792 transitions. [2024-10-11 21:21:43,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 21:21:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 792 transitions. [2024-10-11 21:21:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 21:21:43,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:43,778 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:43,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:21:43,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:43,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:43,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1590952997, now seen corresponding path program 1 times [2024-10-11 21:21:43,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:43,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121915073] [2024-10-11 21:21:43,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 21:21:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 21:21:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:21:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121915073] [2024-10-11 21:21:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121915073] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299871747] [2024-10-11 21:21:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:43,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:43,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:43,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:21:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:44,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:21:44,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:44,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299871747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:44,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:44,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-11 21:21:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803984307] [2024-10-11 21:21:44,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:44,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:44,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:44,294 INFO L87 Difference]: Start difference. First operand 565 states and 792 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 21:21:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:44,445 INFO L93 Difference]: Finished difference Result 1046 states and 1473 transitions. [2024-10-11 21:21:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:44,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 56 [2024-10-11 21:21:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:44,449 INFO L225 Difference]: With dead ends: 1046 [2024-10-11 21:21:44,449 INFO L226 Difference]: Without dead ends: 569 [2024-10-11 21:21:44,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:44,450 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 8 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:44,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 313 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-11 21:21:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2024-10-11 21:21:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 415 states have (on average 1.4409638554216868) internal successors, (598), 422 states have internal predecessors, (598), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 21:21:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 794 transitions. [2024-10-11 21:21:44,484 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 794 transitions. Word has length 56 [2024-10-11 21:21:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:44,485 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 794 transitions. [2024-10-11 21:21:44,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 21:21:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 794 transitions. [2024-10-11 21:21:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 21:21:44,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:44,487 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:44,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:21:44,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:44,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:44,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2074902486, now seen corresponding path program 1 times [2024-10-11 21:21:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326200773] [2024-10-11 21:21:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 21:21:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 21:21:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 21:21:44,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326200773] [2024-10-11 21:21:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326200773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:44,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:44,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:44,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876674320] [2024-10-11 21:21:44,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:44,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:44,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:44,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:44,826 INFO L87 Difference]: Start difference. First operand 569 states and 794 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:21:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:45,052 INFO L93 Difference]: Finished difference Result 589 states and 826 transitions. [2024-10-11 21:21:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:45,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-11 21:21:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:45,055 INFO L225 Difference]: With dead ends: 589 [2024-10-11 21:21:45,056 INFO L226 Difference]: Without dead ends: 587 [2024-10-11 21:21:45,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:45,056 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 22 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:45,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 369 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-10-11 21:21:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 563. [2024-10-11 21:21:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 411 states have (on average 1.4306569343065694) internal successors, (588), 416 states have internal predecessors, (588), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 21:21:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 784 transitions. [2024-10-11 21:21:45,074 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 784 transitions. Word has length 57 [2024-10-11 21:21:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:45,074 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 784 transitions. [2024-10-11 21:21:45,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:21:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 784 transitions. [2024-10-11 21:21:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:21:45,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:45,075 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:45,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:21:45,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:45,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1714195833, now seen corresponding path program 1 times [2024-10-11 21:21:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322404318] [2024-10-11 21:21:45,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:21:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 21:21:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322404318] [2024-10-11 21:21:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322404318] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484681175] [2024-10-11 21:21:45,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:45,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:45,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:45,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:21:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 21:21:45,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 21:21:45,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:45,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484681175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:45,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 21:21:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389680088] [2024-10-11 21:21:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:45,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:21:45,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:45,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:21:45,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:45,481 INFO L87 Difference]: Start difference. First operand 563 states and 784 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 21:21:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:45,612 INFO L93 Difference]: Finished difference Result 902 states and 1259 transitions. [2024-10-11 21:21:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:21:45,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2024-10-11 21:21:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:45,615 INFO L225 Difference]: With dead ends: 902 [2024-10-11 21:21:45,615 INFO L226 Difference]: Without dead ends: 567 [2024-10-11 21:21:45,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:45,616 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:45,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 312 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:45,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-10-11 21:21:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2024-10-11 21:21:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 414 states have (on average 1.429951690821256) internal successors, (592), 419 states have internal predecessors, (592), 99 states have call successors, (99), 48 states have call predecessors, (99), 48 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 21:21:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 790 transitions. [2024-10-11 21:21:45,633 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 790 transitions. Word has length 60 [2024-10-11 21:21:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:45,634 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 790 transitions. [2024-10-11 21:21:45,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 21:21:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 790 transitions. [2024-10-11 21:21:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 21:21:45,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:45,635 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:45,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 21:21:45,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:45,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:45,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash 483026349, now seen corresponding path program 1 times [2024-10-11 21:21:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164383472] [2024-10-11 21:21:45,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:21:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 21:21:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 21:21:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164383472] [2024-10-11 21:21:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164383472] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35863663] [2024-10-11 21:21:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:45,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:45,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:45,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:45,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:21:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 21:21:46,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 21:21:46,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35863663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:46,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 21:21:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049581982] [2024-10-11 21:21:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:46,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:21:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:46,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:21:46,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:46,267 INFO L87 Difference]: Start difference. First operand 567 states and 790 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:21:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:46,384 INFO L93 Difference]: Finished difference Result 567 states and 790 transitions. [2024-10-11 21:21:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:21:46,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-10-11 21:21:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:46,387 INFO L225 Difference]: With dead ends: 567 [2024-10-11 21:21:46,388 INFO L226 Difference]: Without dead ends: 566 [2024-10-11 21:21:46,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:46,389 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:46,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 310 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-10-11 21:21:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2024-10-11 21:21:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 414 states have (on average 1.4251207729468598) internal successors, (590), 418 states have internal predecessors, (590), 99 states have call successors, (99), 48 states have call predecessors, (99), 48 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 21:21:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 788 transitions. [2024-10-11 21:21:46,417 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 788 transitions. Word has length 63 [2024-10-11 21:21:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:46,417 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 788 transitions. [2024-10-11 21:21:46,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:21:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 788 transitions. [2024-10-11 21:21:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 21:21:46,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:46,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:46,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 21:21:46,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:46,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1697759935, now seen corresponding path program 1 times [2024-10-11 21:21:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493058302] [2024-10-11 21:21:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:21:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 21:21:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 21:21:46,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493058302] [2024-10-11 21:21:46,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493058302] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11137892] [2024-10-11 21:21:46,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:46,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:46,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:46,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:21:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:47,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 21:21:47,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:21:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 21:21:47,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11137892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:21:47,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:21:47,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2024-10-11 21:21:47,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693287638] [2024-10-11 21:21:47,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:21:47,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:21:47,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:47,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:21:47,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:21:47,169 INFO L87 Difference]: Start difference. First operand 566 states and 788 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 21:21:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:47,539 INFO L93 Difference]: Finished difference Result 1106 states and 1543 transitions. [2024-10-11 21:21:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:21:47,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 66 [2024-10-11 21:21:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:47,543 INFO L225 Difference]: With dead ends: 1106 [2024-10-11 21:21:47,543 INFO L226 Difference]: Without dead ends: 628 [2024-10-11 21:21:47,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:21:47,544 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 44 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:47,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 496 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-11 21:21:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 592. [2024-10-11 21:21:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 436 states have (on average 1.408256880733945) internal successors, (614), 440 states have internal predecessors, (614), 103 states have call successors, (103), 48 states have call predecessors, (103), 48 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 21:21:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 820 transitions. [2024-10-11 21:21:47,565 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 820 transitions. Word has length 66 [2024-10-11 21:21:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:47,565 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 820 transitions. [2024-10-11 21:21:47,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 21:21:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 820 transitions. [2024-10-11 21:21:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 21:21:47,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:47,566 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:47,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 21:21:47,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 21:21:47,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:47,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2133236865, now seen corresponding path program 1 times [2024-10-11 21:21:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:47,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690820414] [2024-10-11 21:21:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 21:21:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 21:21:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:21:47,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:47,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690820414] [2024-10-11 21:21:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690820414] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:47,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378566151] [2024-10-11 21:21:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:47,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:47,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:47,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:47,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:21:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:48,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 21:21:48,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:48,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378566151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:48,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:48,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2024-10-11 21:21:48,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075215710] [2024-10-11 21:21:48,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:48,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:48,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:48,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:48,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:21:48,336 INFO L87 Difference]: Start difference. First operand 592 states and 820 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 21:21:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:48,589 INFO L93 Difference]: Finished difference Result 745 states and 1032 transitions. [2024-10-11 21:21:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:48,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2024-10-11 21:21:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:48,592 INFO L225 Difference]: With dead ends: 745 [2024-10-11 21:21:48,592 INFO L226 Difference]: Without dead ends: 743 [2024-10-11 21:21:48,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:21:48,593 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 298 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:48,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 390 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-10-11 21:21:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 590. [2024-10-11 21:21:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 436 states have (on average 1.4036697247706422) internal successors, (612), 438 states have internal predecessors, (612), 103 states have call successors, (103), 48 states have call predecessors, (103), 48 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 21:21:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 818 transitions. [2024-10-11 21:21:48,613 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 818 transitions. Word has length 70 [2024-10-11 21:21:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:48,613 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 818 transitions. [2024-10-11 21:21:48,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 21:21:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 818 transitions. [2024-10-11 21:21:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 21:21:48,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:48,615 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:48,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 21:21:48,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 21:21:48,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:48,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1705833132, now seen corresponding path program 1 times [2024-10-11 21:21:48,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:48,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917117746] [2024-10-11 21:21:48,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:48,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 21:21:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 21:21:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:21:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917117746] [2024-10-11 21:21:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917117746] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965606960] [2024-10-11 21:21:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:48,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:48,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:48,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:49,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:21:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:49,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:49,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 21:21:49,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:21:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 21:21:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965606960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:21:49,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:21:49,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2, 3] total 9 [2024-10-11 21:21:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552500369] [2024-10-11 21:21:49,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:21:49,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:21:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:21:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:21:49,463 INFO L87 Difference]: Start difference. First operand 590 states and 818 transitions. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 8 states have internal predecessors, (151), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 21:21:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:50,197 INFO L93 Difference]: Finished difference Result 1482 states and 2076 transitions. [2024-10-11 21:21:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:21:50,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 8 states have internal predecessors, (151), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 71 [2024-10-11 21:21:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:50,202 INFO L225 Difference]: With dead ends: 1482 [2024-10-11 21:21:50,202 INFO L226 Difference]: Without dead ends: 1133 [2024-10-11 21:21:50,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:21:50,203 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 946 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:50,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 673 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:21:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-10-11 21:21:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 943. [2024-10-11 21:21:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 698 states have (on average 1.4011461318051577) internal successors, (978), 699 states have internal predecessors, (978), 166 states have call successors, (166), 77 states have call predecessors, (166), 77 states have return successors, (166), 166 states have call predecessors, (166), 166 states have call successors, (166) [2024-10-11 21:21:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1310 transitions. [2024-10-11 21:21:50,236 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1310 transitions. Word has length 71 [2024-10-11 21:21:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:50,237 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1310 transitions. [2024-10-11 21:21:50,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 8 states have internal predecessors, (151), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 21:21:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1310 transitions. [2024-10-11 21:21:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 21:21:50,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:50,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:50,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:21:50,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 21:21:50,439 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:50,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1103824476, now seen corresponding path program 1 times [2024-10-11 21:21:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:50,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19592203] [2024-10-11 21:21:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:50,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 21:21:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 21:21:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:21:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 21:21:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 21:21:50,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:50,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19592203] [2024-10-11 21:21:50,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19592203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:50,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:50,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:50,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764214972] [2024-10-11 21:21:50,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:50,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:50,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:50,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:50,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:50,587 INFO L87 Difference]: Start difference. First operand 943 states and 1310 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 21:21:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:50,840 INFO L93 Difference]: Finished difference Result 975 states and 1364 transitions. [2024-10-11 21:21:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-10-11 21:21:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:50,844 INFO L225 Difference]: With dead ends: 975 [2024-10-11 21:21:50,844 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 21:21:50,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:50,845 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 17 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:50,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 373 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 21:21:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 936. [2024-10-11 21:21:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 694 states have (on average 1.4005763688760806) internal successors, (972), 694 states have internal predecessors, (972), 164 states have call successors, (164), 77 states have call predecessors, (164), 77 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2024-10-11 21:21:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1300 transitions. [2024-10-11 21:21:50,876 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1300 transitions. Word has length 80 [2024-10-11 21:21:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:50,877 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1300 transitions. [2024-10-11 21:21:50,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 21:21:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1300 transitions. [2024-10-11 21:21:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 21:21:50,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:50,879 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:50,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 21:21:50,879 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:50,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash 456277522, now seen corresponding path program 1 times [2024-10-11 21:21:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319507968] [2024-10-11 21:21:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:21:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:21:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 21:21:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 21:21:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 21:21:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 21:21:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 21:21:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 21:21:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-10-11 21:21:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319507968] [2024-10-11 21:21:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319507968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:51,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:21:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319668830] [2024-10-11 21:21:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:51,116 INFO L87 Difference]: Start difference. First operand 936 states and 1300 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:21:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:51,591 INFO L93 Difference]: Finished difference Result 1634 states and 2277 transitions. [2024-10-11 21:21:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:51,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 130 [2024-10-11 21:21:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:51,595 INFO L225 Difference]: With dead ends: 1634 [2024-10-11 21:21:51,595 INFO L226 Difference]: Without dead ends: 786 [2024-10-11 21:21:51,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:51,598 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 140 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:51,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 531 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:21:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-10-11 21:21:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 762. [2024-10-11 21:21:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 570 states have (on average 1.3789473684210527) internal successors, (786), 570 states have internal predecessors, (786), 132 states have call successors, (132), 59 states have call predecessors, (132), 59 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-11 21:21:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1050 transitions. [2024-10-11 21:21:51,644 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1050 transitions. Word has length 130 [2024-10-11 21:21:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:51,644 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1050 transitions. [2024-10-11 21:21:51,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:21:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1050 transitions. [2024-10-11 21:21:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 21:21:51,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:51,647 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2024-10-11 21:21:51,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 21:21:51,647 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:51,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1753605912, now seen corresponding path program 2 times [2024-10-11 21:21:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:51,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103865101] [2024-10-11 21:21:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:21:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:21:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 21:21:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 21:21:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 21:21:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 21:21:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:21:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 21:21:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 21:21:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 21:21:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-11 21:21:51,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:51,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103865101] [2024-10-11 21:21:51,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103865101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:51,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:21:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694958787] [2024-10-11 21:21:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:51,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:51,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:51,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:51,870 INFO L87 Difference]: Start difference. First operand 762 states and 1050 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:21:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:52,282 INFO L93 Difference]: Finished difference Result 1031 states and 1423 transitions. [2024-10-11 21:21:52,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:52,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 148 [2024-10-11 21:21:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:52,284 INFO L225 Difference]: With dead ends: 1031 [2024-10-11 21:21:52,284 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:21:52,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:52,285 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 151 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:52,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 472 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:21:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:21:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:21:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:21:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:21:52,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2024-10-11 21:21:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:52,287 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:21:52,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:21:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:21:52,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:21:52,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-11 21:21:52,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-11 21:21:52,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-11 21:21:52,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-11 21:21:52,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-11 21:21:52,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-11 21:21:52,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-11 21:21:52,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-11 21:21:52,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-11 21:21:52,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-11 21:21:52,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 21:21:52,294 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:52,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:21:56,020 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:21:56,046 WARN L155 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) (= |old(#valid)| |#valid|)) Eliminated clause: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (= ~ref_cnt~0 1) .cse0) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2024-10-11 21:21:56,054 WARN L155 FloydHoareUtils]: Requires clause for rdev_get_drvdata contained old-variable. Original clause: (and (= |old(#length)| |#length|) (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) (= |old(#valid)| |#valid|)) Eliminated clause: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (= ~ref_cnt~0 1) .cse0) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2024-10-11 21:21:56,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:21:56 BoogieIcfgContainer [2024-10-11 21:21:56,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:21:56,061 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:21:56,061 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:21:56,062 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:21:56,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:40" (3/4) ... [2024-10-11 21:21:56,066 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:21:56,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2024-10-11 21:21:56,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-10-11 21:21:56,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-11 21:21:56,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2024-10-11 21:21:56,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_unregister [2024-10-11 21:21:56,069 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2024-10-11 21:21:56,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-10-11 21:21:56,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rdev_get_drvdata [2024-10-11 21:21:56,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_list_voltage_linear [2024-10-11 21:21:56,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2024-10-11 21:21:56,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2024-10-11 21:21:56,080 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2024-10-11 21:21:56,081 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2024-10-11 21:21:56,082 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 21:21:56,082 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 21:21:56,083 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:21:56,234 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:21:56,234 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:21:56,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:21:56,235 INFO L158 Benchmark]: Toolchain (without parser) took 17827.82ms. Allocated memory was 146.8MB in the beginning and 570.4MB in the end (delta: 423.6MB). Free memory was 85.5MB in the beginning and 198.2MB in the end (delta: -112.7MB). Peak memory consumption was 314.6MB. Max. memory is 16.1GB. [2024-10-11 21:21:56,236 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:21:56,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.41ms. Allocated memory was 146.8MB in the beginning and 222.3MB in the end (delta: 75.5MB). Free memory was 85.5MB in the beginning and 173.4MB in the end (delta: -87.9MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-10-11 21:21:56,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.63ms. Allocated memory is still 222.3MB. Free memory was 173.4MB in the beginning and 167.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 21:21:56,237 INFO L158 Benchmark]: Boogie Preprocessor took 152.89ms. Allocated memory is still 222.3MB. Free memory was 167.1MB in the beginning and 154.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 21:21:56,237 INFO L158 Benchmark]: RCFGBuilder took 1122.05ms. Allocated memory is still 222.3MB. Free memory was 154.5MB in the beginning and 151.0MB in the end (delta: 3.6MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-10-11 21:21:56,239 INFO L158 Benchmark]: TraceAbstraction took 15475.61ms. Allocated memory was 222.3MB in the beginning and 570.4MB in the end (delta: 348.1MB). Free memory was 149.9MB in the beginning and 216.0MB in the end (delta: -66.1MB). Peak memory consumption was 323.9MB. Max. memory is 16.1GB. [2024-10-11 21:21:56,239 INFO L158 Benchmark]: Witness Printer took 173.32ms. Allocated memory is still 570.4MB. Free memory was 216.0MB in the beginning and 198.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 21:21:56,240 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.41ms. Allocated memory was 146.8MB in the beginning and 222.3MB in the end (delta: 75.5MB). Free memory was 85.5MB in the beginning and 173.4MB in the end (delta: -87.9MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.63ms. Allocated memory is still 222.3MB. Free memory was 173.4MB in the beginning and 167.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 152.89ms. Allocated memory is still 222.3MB. Free memory was 167.1MB in the beginning and 154.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1122.05ms. Allocated memory is still 222.3MB. Free memory was 154.5MB in the beginning and 151.0MB in the end (delta: 3.6MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15475.61ms. Allocated memory was 222.3MB in the beginning and 570.4MB in the end (delta: 348.1MB). Free memory was 149.9MB in the beginning and 216.0MB in the end (delta: -66.1MB). Peak memory consumption was 323.9MB. Max. memory is 16.1GB. * Witness Printer took 173.32ms. Allocated memory is still 570.4MB. Free memory was 216.0MB in the beginning and 198.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2353]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2353]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2368]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2368]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2466]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2466]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2389]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2389]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2476]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2476]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 158 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2452 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2328 mSDsluCounter, 7091 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4054 mSDsCounter, 530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2705 IncrementalHoareTripleChecker+Invalid, 3235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 530 mSolverCounterUnsat, 3037 mSDtfsCounter, 2705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 737 GetRequests, 677 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=943occurred in iteration=13, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 775 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1370 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1483 ConstructedInterpolants, 0 QuantifiedInterpolants, 2549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6842 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 728/764 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 2172]: Location Invariant Derived location invariant: ((((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) - ProcedureContractResult [Line: 3197]: Procedure Contract for mutex_unlock Derived contract for procedure mutex_unlock. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) - ProcedureContractResult [Line: 2942]: Procedure Contract for ldv_mutex_lock_mtx_of_isl_pmic Derived contract for procedure ldv_mutex_lock_mtx_of_isl_pmic. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) - ProcedureContractResult [Line: 3158]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) - ProcedureContractResult [Line: 2684]: Procedure Contract for ldv_error Derived contract for procedure ldv_error. Ensures: 0 - ProcedureContractResult [Line: 3214]: Procedure Contract for regulator_unregister Derived contract for procedure regulator_unregister. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 3190]: Procedure Contract for mutex_lock Derived contract for procedure mutex_lock. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) - ProcedureContractResult [Line: 3000]: Procedure Contract for ldv_mutex_unlock_mtx_of_isl_pmic Derived contract for procedure ldv_mutex_unlock_mtx_of_isl_pmic. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) - ProcedureContractResult [Line: 3200]: Procedure Contract for rdev_get_drvdata Derived contract for procedure rdev_get_drvdata. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) - ProcedureContractResult [Line: 3204]: Procedure Contract for regulator_list_voltage_linear Derived contract for procedure regulator_list_voltage_linear. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) - ProcedureContractResult [Line: 3149]: Procedure Contract for dev_err Derived contract for procedure dev_err. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) - ProcedureContractResult [Line: 2172]: Procedure Contract for IS_ERR Derived contract for procedure IS_ERR. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) || ((ldv_state_variable_1 == 0) && (ref_cnt == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:21:56,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE