./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:03:22,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:03:22,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:03:22,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:03:22,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:03:22,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:03:22,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:03:22,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:03:22,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:03:22,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:03:22,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:03:22,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:03:22,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:03:22,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:03:22,602 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:03:22,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:03:22,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:03:22,603 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:03:22,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:03:22,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:03:22,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:03:22,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:03:22,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:03:22,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:03:22,605 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:03:22,605 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:03:22,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:03:22,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:03:22,606 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:03:22,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:03:22,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:03:22,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:03:22,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:03:22,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:03:22,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:03:22,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:03:22,608 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-03-09 06:03:23,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:03:23,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:03:23,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:03:23,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:03:23,045 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:03:23,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2025-03-09 06:03:24,921 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79f50d6de/05f29abc4f5b4cbc8bd7ab12d57ab5bd/FLAGeea4362b9 [2025-03-09 06:03:25,445 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:03:25,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2025-03-09 06:03:25,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79f50d6de/05f29abc4f5b4cbc8bd7ab12d57ab5bd/FLAGeea4362b9 [2025-03-09 06:03:25,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79f50d6de/05f29abc4f5b4cbc8bd7ab12d57ab5bd [2025-03-09 06:03:25,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:03:25,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:03:25,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:03:25,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:03:25,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:03:25,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:03:25" (1/1) ... [2025-03-09 06:03:25,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19211522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:25, skipping insertion in model container [2025-03-09 06:03:25,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:03:25" (1/1) ... [2025-03-09 06:03:25,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:03:26,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:03:26,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:03:26,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:03:26,402 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:03:26,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26 WrapperNode [2025-03-09 06:03:26,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:03:26,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:03:26,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:03:26,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:03:26,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,539 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1247 [2025-03-09 06:03:26,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:03:26,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:03:26,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:03:26,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:03:26,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,647 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [34, 2, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [4, 0, 42]. [2025-03-09 06:03:26,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:03:26,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:03:26,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:03:26,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:03:26,753 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (1/1) ... [2025-03-09 06:03:26,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:03:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:26,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:03:26,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:03:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 06:03:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 06:03:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 06:03:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 06:03:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 06:03:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 06:03:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:03:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:03:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:03:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 06:03:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:03:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:03:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:03:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:03:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:03:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:03:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:03:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:03:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:03:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:03:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:03:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 06:03:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:03:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:03:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:03:26,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:03:26,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:03:27,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:03:27,150 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:03:28,986 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-09 06:03:29,136 INFO L? ?]: Removed 303 outVars from TransFormulas that were not future-live. [2025-03-09 06:03:29,140 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:03:29,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:03:29,291 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 06:03:29,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:03:29 BoogieIcfgContainer [2025-03-09 06:03:29,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:03:29,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:03:29,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:03:29,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:03:29,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:03:25" (1/3) ... [2025-03-09 06:03:29,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21148f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:03:29, skipping insertion in model container [2025-03-09 06:03:29,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:26" (2/3) ... [2025-03-09 06:03:29,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21148f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:03:29, skipping insertion in model container [2025-03-09 06:03:29,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:03:29" (3/3) ... [2025-03-09 06:03:29,310 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2025-03-09 06:03:29,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:03:29,338 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test2-1.i that has 4 procedures, 380 locations, 1 initial locations, 31 loop locations, and 6 error locations. [2025-03-09 06:03:29,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:03:29,453 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;@36c9368a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:03:29,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:03:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 372 states, 361 states have (on average 1.6232686980609419) internal successors, (586), 367 states have internal predecessors, (586), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 06:03:29,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:29,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:29,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:29,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash -817968332, now seen corresponding path program 1 times [2025-03-09 06:03:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:29,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098778588] [2025-03-09 06:03:29,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:29,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:03:29,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:03:29,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:29,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:29,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098778588] [2025-03-09 06:03:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098778588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:29,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:29,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:03:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570636580] [2025-03-09 06:03:29,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:29,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 06:03:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:29,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:03:29,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:03:29,806 INFO L87 Difference]: Start difference. First operand has 372 states, 361 states have (on average 1.6232686980609419) internal successors, (586), 367 states have internal predecessors, (586), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2025-03-09 06:03:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:29,982 INFO L93 Difference]: Finished difference Result 740 states and 1179 transitions. [2025-03-09 06:03:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:03:29,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-03-09 06:03:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:30,004 INFO L225 Difference]: With dead ends: 740 [2025-03-09 06:03:30,004 INFO L226 Difference]: Without dead ends: 366 [2025-03-09 06:03:30,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:03:30,013 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:30,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:03:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-09 06:03:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-03-09 06:03:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 356 states have (on average 1.4691011235955056) internal successors, (523), 361 states have internal predecessors, (523), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 529 transitions. [2025-03-09 06:03:30,107 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 529 transitions. Word has length 8 [2025-03-09 06:03:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:30,111 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 529 transitions. [2025-03-09 06:03:30,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2025-03-09 06:03:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 529 transitions. [2025-03-09 06:03:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 06:03:30,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:30,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:30,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:03:30,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:30,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash -817967371, now seen corresponding path program 1 times [2025-03-09 06:03:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:30,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089488587] [2025-03-09 06:03:30,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:30,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:03:30,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:03:30,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:30,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:03:30,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707750498] [2025-03-09 06:03:30,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:30,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:30,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:30,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:30,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:03:30,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:03:30,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:03:30,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:30,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:30,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:03:30,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:30,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:30,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089488587] [2025-03-09 06:03:30,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 06:03:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707750498] [2025-03-09 06:03:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707750498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:30,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:30,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937023479] [2025-03-09 06:03:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:30,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:30,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:30,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:30,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:30,478 INFO L87 Difference]: Start difference. First operand 366 states and 529 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-09 06:03:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:30,867 INFO L93 Difference]: Finished difference Result 725 states and 1051 transitions. [2025-03-09 06:03:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:30,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-09 06:03:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:30,872 INFO L225 Difference]: With dead ends: 725 [2025-03-09 06:03:30,872 INFO L226 Difference]: Without dead ends: 723 [2025-03-09 06:03:30,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:03:30,878 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 509 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:30,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1389 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 06:03:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-09 06:03:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 372. [2025-03-09 06:03:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 362 states have (on average 1.4640883977900552) internal successors, (530), 367 states have internal predecessors, (530), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 536 transitions. [2025-03-09 06:03:30,930 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 536 transitions. Word has length 8 [2025-03-09 06:03:30,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:30,930 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 536 transitions. [2025-03-09 06:03:30,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-09 06:03:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 536 transitions. [2025-03-09 06:03:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 06:03:30,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:30,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:30,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 06:03:31,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:31,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1760185792, now seen corresponding path program 1 times [2025-03-09 06:03:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176508992] [2025-03-09 06:03:31,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:31,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:31,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 06:03:31,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 06:03:31,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:31,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176508992] [2025-03-09 06:03:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176508992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:31,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:31,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:03:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42343710] [2025-03-09 06:03:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:31,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:31,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:31,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:31,647 INFO L87 Difference]: Start difference. First operand 372 states and 536 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-03-09 06:03:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:31,847 INFO L93 Difference]: Finished difference Result 488 states and 703 transitions. [2025-03-09 06:03:31,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:03:31,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-03-09 06:03:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:31,853 INFO L225 Difference]: With dead ends: 488 [2025-03-09 06:03:31,853 INFO L226 Difference]: Without dead ends: 330 [2025-03-09 06:03:31,853 INFO L434 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 [2025-03-09 06:03:31,854 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 36 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:31,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1165 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:03:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-09 06:03:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-09 06:03:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 320 states have (on average 1.415625) internal successors, (453), 325 states have internal predecessors, (453), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 459 transitions. [2025-03-09 06:03:31,879 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 459 transitions. Word has length 65 [2025-03-09 06:03:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:31,879 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 459 transitions. [2025-03-09 06:03:31,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-03-09 06:03:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 459 transitions. [2025-03-09 06:03:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 06:03:31,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:31,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:03:31,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1926067190, now seen corresponding path program 1 times [2025-03-09 06:03:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194749139] [2025-03-09 06:03:31,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:31,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 06:03:31,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 06:03:31,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:31,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194749139] [2025-03-09 06:03:32,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194749139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:32,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:32,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:03:32,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863758955] [2025-03-09 06:03:32,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:32,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:32,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:32,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:32,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:32,168 INFO L87 Difference]: Start difference. First operand 330 states and 459 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-03-09 06:03:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:32,345 INFO L93 Difference]: Finished difference Result 440 states and 609 transitions. [2025-03-09 06:03:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:03:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-03-09 06:03:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:32,347 INFO L225 Difference]: With dead ends: 440 [2025-03-09 06:03:32,347 INFO L226 Difference]: Without dead ends: 324 [2025-03-09 06:03:32,352 INFO L434 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 [2025-03-09 06:03:32,352 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 9 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:32,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1166 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:03:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-09 06:03:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-03-09 06:03:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 314 states have (on average 1.410828025477707) internal successors, (443), 319 states have internal predecessors, (443), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 449 transitions. [2025-03-09 06:03:32,371 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 449 transitions. Word has length 65 [2025-03-09 06:03:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:32,372 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 449 transitions. [2025-03-09 06:03:32,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-03-09 06:03:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 449 transitions. [2025-03-09 06:03:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 06:03:32,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:32,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:32,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:03:32,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:32,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash 150858234, now seen corresponding path program 1 times [2025-03-09 06:03:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817558327] [2025-03-09 06:03:32,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:32,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 06:03:32,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 06:03:32,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:32,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:32,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817558327] [2025-03-09 06:03:32,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817558327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:32,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:32,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:32,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077212003] [2025-03-09 06:03:32,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:32,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:32,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:32,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:32,784 INFO L87 Difference]: Start difference. First operand 324 states and 449 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-03-09 06:03:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:33,026 INFO L93 Difference]: Finished difference Result 627 states and 875 transitions. [2025-03-09 06:03:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:33,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-03-09 06:03:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:33,032 INFO L225 Difference]: With dead ends: 627 [2025-03-09 06:03:33,032 INFO L226 Difference]: Without dead ends: 625 [2025-03-09 06:03:33,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:03:33,039 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 366 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:33,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1259 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:03:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-09 06:03:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 432. [2025-03-09 06:03:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 422 states have (on average 1.3909952606635072) internal successors, (587), 427 states have internal predecessors, (587), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 593 transitions. [2025-03-09 06:03:33,068 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 593 transitions. Word has length 65 [2025-03-09 06:03:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:33,068 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 593 transitions. [2025-03-09 06:03:33,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-03-09 06:03:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 593 transitions. [2025-03-09 06:03:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 06:03:33,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:33,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:33,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:03:33,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:33,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1469598181, now seen corresponding path program 1 times [2025-03-09 06:03:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:33,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143821904] [2025-03-09 06:03:33,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:33,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:03:33,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:03:33,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:33,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:33,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:33,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143821904] [2025-03-09 06:03:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143821904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:33,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:33,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:03:33,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793737217] [2025-03-09 06:03:33,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:33,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:33,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:33,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:33,409 INFO L87 Difference]: Start difference. First operand 432 states and 593 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-03-09 06:03:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:33,592 INFO L93 Difference]: Finished difference Result 858 states and 1179 transitions. [2025-03-09 06:03:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:33,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-03-09 06:03:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:33,598 INFO L225 Difference]: With dead ends: 858 [2025-03-09 06:03:33,598 INFO L226 Difference]: Without dead ends: 435 [2025-03-09 06:03:33,599 INFO L434 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 [2025-03-09 06:03:33,599 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 105 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:33,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1065 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:03:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-09 06:03:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2025-03-09 06:03:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 422 states have (on average 1.3744075829383886) internal successors, (580), 427 states have internal predecessors, (580), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 586 transitions. [2025-03-09 06:03:33,627 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 586 transitions. Word has length 80 [2025-03-09 06:03:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:33,627 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 586 transitions. [2025-03-09 06:03:33,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-03-09 06:03:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 586 transitions. [2025-03-09 06:03:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 06:03:33,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:33,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:33,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:03:33,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:33,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:33,630 INFO L85 PathProgramCache]: Analyzing trace with hash 83654462, now seen corresponding path program 1 times [2025-03-09 06:03:33,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:33,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501457321] [2025-03-09 06:03:33,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:33,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:03:33,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:03:33,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:33,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:33,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:33,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501457321] [2025-03-09 06:03:33,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501457321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:33,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:33,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208243836] [2025-03-09 06:03:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:33,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:03:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:33,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:03:33,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:03:33,890 INFO L87 Difference]: Start difference. First operand 432 states and 586 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2025-03-09 06:03:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:34,076 INFO L93 Difference]: Finished difference Result 1157 states and 1580 transitions. [2025-03-09 06:03:34,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:03:34,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-03-09 06:03:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:34,083 INFO L225 Difference]: With dead ends: 1157 [2025-03-09 06:03:34,084 INFO L226 Difference]: Without dead ends: 734 [2025-03-09 06:03:34,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:03:34,086 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 252 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:34,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 789 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:03:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-09 06:03:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 732. [2025-03-09 06:03:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 722 states have (on average 1.3781163434903048) internal successors, (995), 727 states have internal predecessors, (995), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1001 transitions. [2025-03-09 06:03:34,133 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1001 transitions. Word has length 80 [2025-03-09 06:03:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:34,136 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1001 transitions. [2025-03-09 06:03:34,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2025-03-09 06:03:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1001 transitions. [2025-03-09 06:03:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 06:03:34,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:34,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:34,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:03:34,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:34,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1754061660, now seen corresponding path program 1 times [2025-03-09 06:03:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:34,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707776051] [2025-03-09 06:03:34,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:34,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 06:03:34,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 06:03:34,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:34,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:03:34,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:34,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707776051] [2025-03-09 06:03:34,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707776051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:34,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:34,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:34,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562098314] [2025-03-09 06:03:34,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:34,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:34,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:34,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:34,756 INFO L87 Difference]: Start difference. First operand 732 states and 1001 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:34,997 INFO L93 Difference]: Finished difference Result 797 states and 1086 transitions. [2025-03-09 06:03:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 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 95 [2025-03-09 06:03:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:35,001 INFO L225 Difference]: With dead ends: 797 [2025-03-09 06:03:35,004 INFO L226 Difference]: Without dead ends: 795 [2025-03-09 06:03:35,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:03:35,005 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 331 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:35,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1160 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:03:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-03-09 06:03:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2025-03-09 06:03:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 782 states have (on average 1.370843989769821) internal successors, (1072), 787 states have internal predecessors, (1072), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:03:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1084 transitions. [2025-03-09 06:03:35,047 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1084 transitions. Word has length 95 [2025-03-09 06:03:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:35,047 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1084 transitions. [2025-03-09 06:03:35,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1084 transitions. [2025-03-09 06:03:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 06:03:35,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:35,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:35,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:03:35,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:35,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash 561348979, now seen corresponding path program 1 times [2025-03-09 06:03:35,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412718844] [2025-03-09 06:03:35,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:35,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:03:35,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:03:35,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:35,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:03:35,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:35,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412718844] [2025-03-09 06:03:35,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412718844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:35,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187807640] [2025-03-09 06:03:35,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:35,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:35,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:35,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:35,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:03:35,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:03:36,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:03:36,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:36,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:36,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 06:03:36,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:36,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:36,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:36,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-09 06:03:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:03:37,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187807640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:37,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:37,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-09 06:03:37,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697753369] [2025-03-09 06:03:37,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:37,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:03:37,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:37,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:03:37,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:03:37,658 INFO L87 Difference]: Start difference. First operand 795 states and 1084 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:40,123 INFO L93 Difference]: Finished difference Result 1471 states and 2000 transitions. [2025-03-09 06:03:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:03:40,128 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 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 101 [2025-03-09 06:03:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:40,130 INFO L225 Difference]: With dead ends: 1471 [2025-03-09 06:03:40,131 INFO L226 Difference]: Without dead ends: 843 [2025-03-09 06:03:40,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:03:40,134 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 686 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:40,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 2308 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 06:03:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-09 06:03:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 820. [2025-03-09 06:03:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 807 states have (on average 1.365551425030979) internal successors, (1102), 812 states have internal predecessors, (1102), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:03:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1114 transitions. [2025-03-09 06:03:40,170 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1114 transitions. Word has length 101 [2025-03-09 06:03:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:40,174 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1114 transitions. [2025-03-09 06:03:40,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1114 transitions. [2025-03-09 06:03:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 06:03:40,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:40,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:40,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:03:40,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-09 06:03:40,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:40,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1405526831, now seen corresponding path program 1 times [2025-03-09 06:03:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:40,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528593458] [2025-03-09 06:03:40,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:40,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:40,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:03:40,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:03:40,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:40,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:03:40,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:40,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528593458] [2025-03-09 06:03:40,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528593458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:40,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091241446] [2025-03-09 06:03:40,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:40,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:40,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:40,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:40,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:03:41,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:03:41,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:03:41,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:41,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:41,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 06:03:41,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:41,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:41,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:41,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-09 06:03:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:03:42,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:42,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091241446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:42,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-09 06:03:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046121588] [2025-03-09 06:03:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:42,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:03:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:42,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:03:42,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:03:42,735 INFO L87 Difference]: Start difference. First operand 820 states and 1114 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:47,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 06:03:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:47,609 INFO L93 Difference]: Finished difference Result 1518 states and 2063 transitions. [2025-03-09 06:03:47,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:03:47,609 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (2), 1 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 102 [2025-03-09 06:03:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:47,613 INFO L225 Difference]: With dead ends: 1518 [2025-03-09 06:03:47,613 INFO L226 Difference]: Without dead ends: 895 [2025-03-09 06:03:47,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:03:47,620 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 768 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:47,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1902 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 743 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-09 06:03:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-09 06:03:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 855. [2025-03-09 06:03:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 842 states have (on average 1.3622327790973872) internal successors, (1147), 847 states have internal predecessors, (1147), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:03:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1159 transitions. [2025-03-09 06:03:47,646 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1159 transitions. Word has length 102 [2025-03-09 06:03:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:47,646 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1159 transitions. [2025-03-09 06:03:47,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1159 transitions. [2025-03-09 06:03:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 06:03:47,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:47,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:47,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 06:03:47,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:47,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:47,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash 507922832, now seen corresponding path program 1 times [2025-03-09 06:03:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:47,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625184292] [2025-03-09 06:03:47,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:47,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:47,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 06:03:47,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:03:47,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:47,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:03:48,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:48,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625184292] [2025-03-09 06:03:48,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625184292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:48,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:48,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:03:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65342402] [2025-03-09 06:03:48,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:48,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:03:48,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:48,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:03:48,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:03:48,191 INFO L87 Difference]: Start difference. First operand 855 states and 1159 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:48,520 INFO L93 Difference]: Finished difference Result 1532 states and 2079 transitions. [2025-03-09 06:03:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:03:48,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 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 103 [2025-03-09 06:03:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:48,523 INFO L225 Difference]: With dead ends: 1532 [2025-03-09 06:03:48,523 INFO L226 Difference]: Without dead ends: 877 [2025-03-09 06:03:48,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:03:48,543 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 9 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:48,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1251 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 06:03:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-09 06:03:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 873. [2025-03-09 06:03:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 860 states have (on average 1.3627906976744186) internal successors, (1172), 865 states have internal predecessors, (1172), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:03:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1184 transitions. [2025-03-09 06:03:48,562 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1184 transitions. Word has length 103 [2025-03-09 06:03:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:48,563 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1184 transitions. [2025-03-09 06:03:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1184 transitions. [2025-03-09 06:03:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 06:03:48,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:48,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:48,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:03:48,566 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:48,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash -980299188, now seen corresponding path program 1 times [2025-03-09 06:03:48,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:48,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757154719] [2025-03-09 06:03:48,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:48,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 06:03:48,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:03:48,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:48,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:03:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:48,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757154719] [2025-03-09 06:03:48,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757154719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:48,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:48,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:03:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884078702] [2025-03-09 06:03:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:48,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:03:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:48,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:03:48,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:03:48,858 INFO L87 Difference]: Start difference. First operand 873 states and 1184 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:49,360 INFO L93 Difference]: Finished difference Result 1557 states and 2114 transitions. [2025-03-09 06:03:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:03:49,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 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 103 [2025-03-09 06:03:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:49,364 INFO L225 Difference]: With dead ends: 1557 [2025-03-09 06:03:49,364 INFO L226 Difference]: Without dead ends: 895 [2025-03-09 06:03:49,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:03:49,366 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 14 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:49,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1768 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:03:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-09 06:03:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 889. [2025-03-09 06:03:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 876 states have (on average 1.3630136986301369) internal successors, (1194), 881 states have internal predecessors, (1194), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:03:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1206 transitions. [2025-03-09 06:03:49,408 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1206 transitions. Word has length 103 [2025-03-09 06:03:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:49,408 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1206 transitions. [2025-03-09 06:03:49,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1206 transitions. [2025-03-09 06:03:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 06:03:49,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:49,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:49,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:03:49,412 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:49,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:49,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1563674712, now seen corresponding path program 1 times [2025-03-09 06:03:49,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:49,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434646293] [2025-03-09 06:03:49,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:49,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 06:03:49,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 06:03:49,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:49,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:03:49,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:49,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434646293] [2025-03-09 06:03:49,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434646293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:49,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346835092] [2025-03-09 06:03:49,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:49,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:49,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:49,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:49,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:03:49,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 06:03:50,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 06:03:50,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:50,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:50,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:03:50,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:50,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:03:50,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346835092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:50,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:50,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2025-03-09 06:03:50,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234425423] [2025-03-09 06:03:50,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:50,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:03:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:50,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:03:50,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:03:50,148 INFO L87 Difference]: Start difference. First operand 889 states and 1206 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:50,353 INFO L93 Difference]: Finished difference Result 1530 states and 2071 transitions. [2025-03-09 06:03:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:03:50,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-03-09 06:03:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:50,359 INFO L225 Difference]: With dead ends: 1530 [2025-03-09 06:03:50,359 INFO L226 Difference]: Without dead ends: 900 [2025-03-09 06:03:50,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:03:50,361 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 380 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:50,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1907 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:03:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-09 06:03:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 892. [2025-03-09 06:03:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 878 states have (on average 1.3633257403189065) internal successors, (1197), 884 states have internal predecessors, (1197), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:03:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1211 transitions. [2025-03-09 06:03:50,381 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1211 transitions. Word has length 104 [2025-03-09 06:03:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:50,382 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1211 transitions. [2025-03-09 06:03:50,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1211 transitions. [2025-03-09 06:03:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 06:03:50,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:50,383 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:50,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 06:03:50,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:50,585 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:50,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash 231152300, now seen corresponding path program 1 times [2025-03-09 06:03:50,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:50,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851437723] [2025-03-09 06:03:50,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:50,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 06:03:50,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 06:03:50,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:50,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:03:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851437723] [2025-03-09 06:03:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851437723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060555425] [2025-03-09 06:03:50,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:50,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:50,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:50,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:03:51,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 06:03:51,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 06:03:51,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:51,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:51,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:03:51,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 06:04:02,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:02,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060555425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:02,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:02,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-09 06:04:02,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284474323] [2025-03-09 06:04:02,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:02,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:04:02,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:02,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:04:02,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:04:02,526 INFO L87 Difference]: Start difference. First operand 892 states and 1211 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:04,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-09 06:04:06,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-09 06:04:10,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-09 06:04:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:11,478 INFO L93 Difference]: Finished difference Result 1585 states and 2154 transitions. [2025-03-09 06:04:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:04:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 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 106 [2025-03-09 06:04:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:11,485 INFO L225 Difference]: With dead ends: 1585 [2025-03-09 06:04:11,489 INFO L226 Difference]: Without dead ends: 898 [2025-03-09 06:04:11,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:04:11,492 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 12 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:11,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1775 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 870 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2025-03-09 06:04:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-09 06:04:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 874. [2025-03-09 06:04:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 860 states have (on average 1.3604651162790697) internal successors, (1170), 866 states have internal predecessors, (1170), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:04:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1184 transitions. [2025-03-09 06:04:11,537 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1184 transitions. Word has length 106 [2025-03-09 06:04:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:11,537 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1184 transitions. [2025-03-09 06:04:11,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1184 transitions. [2025-03-09 06:04:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 06:04:11,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:11,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:11,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 06:04:11,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 06:04:11,740 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash -690232499, now seen corresponding path program 1 times [2025-03-09 06:04:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:11,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758017407] [2025-03-09 06:04:11,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:11,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:11,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 06:04:11,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 06:04:11,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:11,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 06:04:12,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:12,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758017407] [2025-03-09 06:04:12,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758017407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:12,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:04:12,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 06:04:12,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77529012] [2025-03-09 06:04:12,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:12,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:04:12,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:12,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:04:12,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:04:12,302 INFO L87 Difference]: Start difference. First operand 874 states and 1184 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:13,125 INFO L93 Difference]: Finished difference Result 1554 states and 2103 transitions. [2025-03-09 06:04:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:04:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 1 states have call successors, (2), 1 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 107 [2025-03-09 06:04:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:13,134 INFO L225 Difference]: With dead ends: 1554 [2025-03-09 06:04:13,134 INFO L226 Difference]: Without dead ends: 900 [2025-03-09 06:04:13,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:04:13,135 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 20 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:13,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2155 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 06:04:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-09 06:04:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 888. [2025-03-09 06:04:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 874 states have (on average 1.3592677345537758) internal successors, (1188), 880 states have internal predecessors, (1188), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:04:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1202 transitions. [2025-03-09 06:04:13,180 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1202 transitions. Word has length 107 [2025-03-09 06:04:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:13,180 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1202 transitions. [2025-03-09 06:04:13,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1202 transitions. [2025-03-09 06:04:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 06:04:13,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:13,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:13,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:04:13,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:13,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:13,186 INFO L85 PathProgramCache]: Analyzing trace with hash -907959664, now seen corresponding path program 1 times [2025-03-09 06:04:13,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:13,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382597919] [2025-03-09 06:04:13,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:13,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 06:04:13,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 06:04:13,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:13,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:04:13,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:13,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382597919] [2025-03-09 06:04:13,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382597919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:13,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605126836] [2025-03-09 06:04:13,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:13,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:13,769 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:13,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:04:14,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 06:04:14,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 06:04:14,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:14,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:14,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:04:14,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 06:04:14,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605126836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:14,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:14,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-03-09 06:04:14,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60212918] [2025-03-09 06:04:14,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:14,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:04:14,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:14,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:04:14,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:04:14,468 INFO L87 Difference]: Start difference. First operand 888 states and 1202 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:15,261 INFO L93 Difference]: Finished difference Result 1579 states and 2134 transitions. [2025-03-09 06:04:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:04:15,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 1 states have call successors, (2), 1 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 107 [2025-03-09 06:04:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:15,269 INFO L225 Difference]: With dead ends: 1579 [2025-03-09 06:04:15,270 INFO L226 Difference]: Without dead ends: 918 [2025-03-09 06:04:15,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:04:15,275 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 40 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:15,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1894 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 06:04:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-09 06:04:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 898. [2025-03-09 06:04:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 884 states have (on average 1.3574660633484164) internal successors, (1200), 890 states have internal predecessors, (1200), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:04:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1214 transitions. [2025-03-09 06:04:15,313 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1214 transitions. Word has length 107 [2025-03-09 06:04:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:15,314 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1214 transitions. [2025-03-09 06:04:15,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1214 transitions. [2025-03-09 06:04:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 06:04:15,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:15,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:15,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:04:15,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 06:04:15,517 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:15,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1491695192, now seen corresponding path program 1 times [2025-03-09 06:04:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:15,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54870598] [2025-03-09 06:04:15,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:15,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:04:15,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:04:15,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:15,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 06:04:16,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:16,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54870598] [2025-03-09 06:04:16,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54870598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:16,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:04:16,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 06:04:16,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033150089] [2025-03-09 06:04:16,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:16,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:04:16,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:16,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:04:16,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:04:16,118 INFO L87 Difference]: Start difference. First operand 898 states and 1214 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:17,133 INFO L93 Difference]: Finished difference Result 1587 states and 2146 transitions. [2025-03-09 06:04:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:04:17,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 1 states have call successors, (2), 1 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 108 [2025-03-09 06:04:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:17,141 INFO L225 Difference]: With dead ends: 1587 [2025-03-09 06:04:17,141 INFO L226 Difference]: Without dead ends: 916 [2025-03-09 06:04:17,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:04:17,143 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 26 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:17,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2135 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 06:04:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-03-09 06:04:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 904. [2025-03-09 06:04:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 890 states have (on average 1.355056179775281) internal successors, (1206), 896 states have internal predecessors, (1206), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:04:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1220 transitions. [2025-03-09 06:04:17,181 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1220 transitions. Word has length 108 [2025-03-09 06:04:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:17,181 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1220 transitions. [2025-03-09 06:04:17,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1220 transitions. [2025-03-09 06:04:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 06:04:17,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:17,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:17,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:04:17,182 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:17,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash 348697285, now seen corresponding path program 1 times [2025-03-09 06:04:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848559173] [2025-03-09 06:04:17,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:17,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:04:17,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:04:17,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:04:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848559173] [2025-03-09 06:04:17,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848559173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280554927] [2025-03-09 06:04:17,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:17,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:17,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:17,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:17,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:04:18,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:04:18,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:04:18,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:18,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:18,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:04:18,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 06:04:19,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280554927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:19,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:19,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2025-03-09 06:04:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133129722] [2025-03-09 06:04:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:19,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:04:19,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:19,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:04:19,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:04:19,141 INFO L87 Difference]: Start difference. First operand 904 states and 1220 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:20,611 INFO L93 Difference]: Finished difference Result 1582 states and 2134 transitions. [2025-03-09 06:04:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:04:20,612 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 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 108 [2025-03-09 06:04:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:20,618 INFO L225 Difference]: With dead ends: 1582 [2025-03-09 06:04:20,618 INFO L226 Difference]: Without dead ends: 908 [2025-03-09 06:04:20,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:04:20,624 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 11 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:20,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3157 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 06:04:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-09 06:04:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 900. [2025-03-09 06:04:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 886 states have (on average 1.3544018058690745) internal successors, (1200), 892 states have internal predecessors, (1200), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:04:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1214 transitions. [2025-03-09 06:04:20,672 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1214 transitions. Word has length 108 [2025-03-09 06:04:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:20,672 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1214 transitions. [2025-03-09 06:04:20,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1214 transitions. [2025-03-09 06:04:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 06:04:20,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:20,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:20,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 06:04:20,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:20,880 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:20,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:20,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1408432795, now seen corresponding path program 1 times [2025-03-09 06:04:20,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:20,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074498550] [2025-03-09 06:04:20,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:20,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:04:21,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:04:21,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:21,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:04:21,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:21,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074498550] [2025-03-09 06:04:21,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074498550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:21,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866530279] [2025-03-09 06:04:21,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:21,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:21,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:21,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 06:04:21,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:04:21,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:04:21,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:21,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:21,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:04:21,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 06:04:21,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866530279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:21,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:21,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-09 06:04:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236856385] [2025-03-09 06:04:21,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:21,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:04:21,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:21,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:04:21,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:04:21,979 INFO L87 Difference]: Start difference. First operand 900 states and 1214 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:22,394 INFO L93 Difference]: Finished difference Result 1595 states and 2154 transitions. [2025-03-09 06:04:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:04:22,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 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 108 [2025-03-09 06:04:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:22,397 INFO L225 Difference]: With dead ends: 1595 [2025-03-09 06:04:22,397 INFO L226 Difference]: Without dead ends: 928 [2025-03-09 06:04:22,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:04:22,398 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 39 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:22,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1847 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 06:04:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-03-09 06:04:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 914. [2025-03-09 06:04:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 900 states have (on average 1.3555555555555556) internal successors, (1220), 906 states have internal predecessors, (1220), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:04:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1234 transitions. [2025-03-09 06:04:22,429 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1234 transitions. Word has length 108 [2025-03-09 06:04:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:22,429 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1234 transitions. [2025-03-09 06:04:22,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1234 transitions. [2025-03-09 06:04:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 06:04:22,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:22,435 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:22,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 06:04:22,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:22,636 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:22,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash 79789225, now seen corresponding path program 1 times [2025-03-09 06:04:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:22,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368705910] [2025-03-09 06:04:22,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:22,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:04:22,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:04:22,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:22,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:04:22,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:22,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368705910] [2025-03-09 06:04:22,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368705910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:22,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569148292] [2025-03-09 06:04:22,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:22,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:22,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:22,874 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:22,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 06:04:23,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:04:23,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:04:23,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:23,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:23,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:04:23,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:23,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:04:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:04:23,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:04:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:04:23,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569148292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:04:23,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:04:23,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 17 [2025-03-09 06:04:23,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597667999] [2025-03-09 06:04:23,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:04:23,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 06:04:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:23,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 06:04:23,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-09 06:04:23,855 INFO L87 Difference]: Start difference. First operand 914 states and 1234 transitions. Second operand has 17 states, 17 states have (on average 12.235294117647058) internal successors, (208), 17 states have internal predecessors, (208), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 06:04:28,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:04:32,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:04:36,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:04:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:36,796 INFO L93 Difference]: Finished difference Result 1653 states and 2226 transitions. [2025-03-09 06:04:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 06:04:36,800 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.235294117647058) internal successors, (208), 17 states have internal predecessors, (208), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 108 [2025-03-09 06:04:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:36,808 INFO L225 Difference]: With dead ends: 1653 [2025-03-09 06:04:36,809 INFO L226 Difference]: Without dead ends: 1012 [2025-03-09 06:04:36,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 06:04:36,815 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1080 mSDsluCounter, 3950 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:36,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 4401 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 743 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2025-03-09 06:04:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-03-09 06:04:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 999. [2025-03-09 06:04:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 979 states have (on average 1.3575076608784473) internal successors, (1329), 986 states have internal predecessors, (1329), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 06:04:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1349 transitions. [2025-03-09 06:04:36,873 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1349 transitions. Word has length 108 [2025-03-09 06:04:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:36,873 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1349 transitions. [2025-03-09 06:04:36,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.235294117647058) internal successors, (208), 17 states have internal predecessors, (208), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 06:04:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1349 transitions. [2025-03-09 06:04:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 06:04:36,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:36,880 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:36,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 06:04:37,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:37,080 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:37,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash -546744411, now seen corresponding path program 2 times [2025-03-09 06:04:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:37,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116262412] [2025-03-09 06:04:37,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:04:37,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:37,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 06:04:37,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 06:04:37,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:04:37,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 06:04:37,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116262412] [2025-03-09 06:04:37,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116262412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738198826] [2025-03-09 06:04:37,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:04:37,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:37,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:37,647 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:37,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 06:04:38,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 06:04:38,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 112 statements. [2025-03-09 06:04:38,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:04:38,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:38,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:04:38,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:38,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:04:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 06:04:38,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:38,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738198826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:38,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:38,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-09 06:04:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137938463] [2025-03-09 06:04:38,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:38,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:04:38,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:38,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:04:38,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:04:38,172 INFO L87 Difference]: Start difference. First operand 999 states and 1349 transitions. Second operand has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:38,295 INFO L93 Difference]: Finished difference Result 999 states and 1349 transitions. [2025-03-09 06:04:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:04:38,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (2), 1 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 112 [2025-03-09 06:04:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:38,304 INFO L225 Difference]: With dead ends: 999 [2025-03-09 06:04:38,304 INFO L226 Difference]: Without dead ends: 998 [2025-03-09 06:04:38,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:04:38,305 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:38,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 796 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:04:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-09 06:04:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2025-03-09 06:04:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 979 states have (on average 1.3564862104187947) internal successors, (1328), 985 states have internal predecessors, (1328), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 06:04:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1348 transitions. [2025-03-09 06:04:38,355 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1348 transitions. Word has length 112 [2025-03-09 06:04:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:38,356 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1348 transitions. [2025-03-09 06:04:38,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1348 transitions. [2025-03-09 06:04:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 06:04:38,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:38,357 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:38,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 06:04:38,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 06:04:38,558 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:38,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash 230793039, now seen corresponding path program 1 times [2025-03-09 06:04:38,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:38,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833089462] [2025-03-09 06:04:38,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:38,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:04:38,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:04:38,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:38,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 06:04:39,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:39,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833089462] [2025-03-09 06:04:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833089462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:39,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470149517] [2025-03-09 06:04:39,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:39,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:39,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:39,480 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:39,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 06:04:39,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:04:40,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:04:40,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:40,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:40,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:04:40,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:40,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:04:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 06:04:40,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:04:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 06:04:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470149517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:04:40,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:04:40,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 14 [2025-03-09 06:04:40,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118430587] [2025-03-09 06:04:40,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:04:40,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 06:04:40,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:40,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 06:04:40,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:04:40,398 INFO L87 Difference]: Start difference. First operand 998 states and 1348 transitions. Second operand has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 14 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:04:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:40,914 INFO L93 Difference]: Finished difference Result 1638 states and 2202 transitions. [2025-03-09 06:04:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:04:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 14 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 113 [2025-03-09 06:04:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:40,920 INFO L225 Difference]: With dead ends: 1638 [2025-03-09 06:04:40,920 INFO L226 Difference]: Without dead ends: 777 [2025-03-09 06:04:40,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2025-03-09 06:04:40,931 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 385 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:40,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 2349 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 06:04:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-09 06:04:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2025-03-09 06:04:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 760 states have (on average 1.3210526315789475) internal successors, (1004), 766 states have internal predecessors, (1004), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:04:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1018 transitions. [2025-03-09 06:04:40,972 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1018 transitions. Word has length 113 [2025-03-09 06:04:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:40,972 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1018 transitions. [2025-03-09 06:04:40,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 14 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:04:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1018 transitions. [2025-03-09 06:04:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-09 06:04:40,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:40,974 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:40,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 06:04:41,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 06:04:41,175 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:41,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1639442639, now seen corresponding path program 2 times [2025-03-09 06:04:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895459013] [2025-03-09 06:04:41,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:04:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:41,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-09 06:04:41,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 06:04:41,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:04:41,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 06:04:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895459013] [2025-03-09 06:04:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895459013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198168597] [2025-03-09 06:04:42,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:04:42,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:42,179 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:42,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 06:04:42,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-09 06:04:43,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 06:04:43,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:04:43,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:43,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:04:43,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 06:04:43,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:04:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:04:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198168597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:04:43,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:04:43,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2025-03-09 06:04:43,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27395628] [2025-03-09 06:04:43,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:04:43,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 06:04:43,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:43,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 06:04:43,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-09 06:04:43,376 INFO L87 Difference]: Start difference. First operand 777 states and 1018 transitions. Second operand has 22 states, 22 states have (on average 5.818181818181818) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 06:04:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:44,449 INFO L93 Difference]: Finished difference Result 1382 states and 1821 transitions. [2025-03-09 06:04:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:04:44,450 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.818181818181818) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 117 [2025-03-09 06:04:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:44,458 INFO L225 Difference]: With dead ends: 1382 [2025-03-09 06:04:44,460 INFO L226 Difference]: Without dead ends: 796 [2025-03-09 06:04:44,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=1177, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 06:04:44,461 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 47 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3779 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:44,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3779 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 06:04:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-09 06:04:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 792. [2025-03-09 06:04:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 775 states have (on average 1.3264516129032258) internal successors, (1028), 781 states have internal predecessors, (1028), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:04:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1042 transitions. [2025-03-09 06:04:44,500 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1042 transitions. Word has length 117 [2025-03-09 06:04:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:44,504 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1042 transitions. [2025-03-09 06:04:44,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.818181818181818) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 06:04:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1042 transitions. [2025-03-09 06:04:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-09 06:04:44,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:44,505 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:44,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 06:04:44,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 06:04:44,709 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:44,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:44,709 INFO L85 PathProgramCache]: Analyzing trace with hash 8466421, now seen corresponding path program 3 times [2025-03-09 06:04:44,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:44,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279864480] [2025-03-09 06:04:44,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:04:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:44,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 124 statements into 7 equivalence classes. [2025-03-09 06:04:44,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 100 of 124 statements. [2025-03-09 06:04:44,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:04:44,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-09 06:04:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:45,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279864480] [2025-03-09 06:04:45,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279864480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:45,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:04:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:04:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597911678] [2025-03-09 06:04:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:45,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:04:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:45,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:04:45,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:04:45,185 INFO L87 Difference]: Start difference. First operand 792 states and 1042 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:45,694 INFO L93 Difference]: Finished difference Result 1441 states and 1904 transitions. [2025-03-09 06:04:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:04:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 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 124 [2025-03-09 06:04:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:45,698 INFO L225 Difference]: With dead ends: 1441 [2025-03-09 06:04:45,698 INFO L226 Difference]: Without dead ends: 798 [2025-03-09 06:04:45,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:04:45,699 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 8 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:45,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1606 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:04:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-09 06:04:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2025-03-09 06:04:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 781 states have (on average 1.323943661971831) internal successors, (1034), 787 states have internal predecessors, (1034), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:04:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1048 transitions. [2025-03-09 06:04:45,718 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1048 transitions. Word has length 124 [2025-03-09 06:04:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:45,718 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1048 transitions. [2025-03-09 06:04:45,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1048 transitions. [2025-03-09 06:04:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-09 06:04:45,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:45,720 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:45,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 06:04:45,720 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:45,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash -459304157, now seen corresponding path program 1 times [2025-03-09 06:04:45,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:45,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123008055] [2025-03-09 06:04:45,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:45,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-09 06:04:45,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-09 06:04:45,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:45,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 118 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 06:04:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:46,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123008055] [2025-03-09 06:04:46,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123008055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:46,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045392206] [2025-03-09 06:04:46,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:46,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:46,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:46,517 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:46,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 06:04:47,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-09 06:04:48,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-09 06:04:48,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:48,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:48,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:04:48,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 55 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-09 06:04:48,343 INFO L312 TraceCheckSpWp]: Computing backward predicates...