./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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_SFH_test5-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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:04:52,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:04:52,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:04:52,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:04:52,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:04:52,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:04:52,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:04:52,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:04:52,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:04:52,585 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:04:52,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:04:52,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:04:52,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:04:52,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:04:52,586 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:04:52,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:04:52,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:04:52,588 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:04:52,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:04:52,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:04:52,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:04:52,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:04:52,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:04:52,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:04:52,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:04:52,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:04:52,589 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2025-03-04 15:04:52,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:04:52,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:04:52,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:04:52,844 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:04:52,844 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:04:52,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2025-03-04 15:04:53,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8839108fd/0a625f2c56f8490faad71e15e76484a8/FLAGee5b58283 [2025-03-04 15:04:54,261 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:04:54,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2025-03-04 15:04:54,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8839108fd/0a625f2c56f8490faad71e15e76484a8/FLAGee5b58283 [2025-03-04 15:04:54,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8839108fd/0a625f2c56f8490faad71e15e76484a8 [2025-03-04 15:04:54,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:04:54,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:04:54,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:04:54,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:04:54,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:04:54,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:04:54" (1/1) ... [2025-03-04 15:04:54,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218b0218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:54, skipping insertion in model container [2025-03-04 15:04:54,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:04:54" (1/1) ... [2025-03-04 15:04:54,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:04:54,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:04:54,952 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:04:55,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:04:55,061 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:04:55,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55 WrapperNode [2025-03-04 15:04:55,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:04:55,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:04:55,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:04:55,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:04:55,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,143 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1984 [2025-03-04 15:04:55,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:04:55,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:04:55,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:04:55,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:04:55,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,238 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2025-03-04 15:04:55,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:04:55,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:04:55,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:04:55,318 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:04:55,319 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (1/1) ... [2025-03-04 15:04:55,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:04:55,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:04:55,340 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-04 15:04:55,341 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-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 15:04:55,356 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 15:04:55,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 15:04:55,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 15:04:55,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 15:04:55,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 15:04:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:04:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:04:55,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:04:55,531 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:04:55,532 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:04:56,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-04 15:04:56,817 INFO L? ?]: Removed 491 outVars from TransFormulas that were not future-live. [2025-03-04 15:04:56,817 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:04:56,874 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:04:56,876 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 15:04:56,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:04:56 BoogieIcfgContainer [2025-03-04 15:04:56,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:04:56,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:04:56,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:04:56,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:04:56,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:04:54" (1/3) ... [2025-03-04 15:04:56,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5207d7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:04:56, skipping insertion in model container [2025-03-04 15:04:56,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:55" (2/3) ... [2025-03-04 15:04:56,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5207d7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:04:56, skipping insertion in model container [2025-03-04 15:04:56,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:04:56" (3/3) ... [2025-03-04 15:04:56,884 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2025-03-04 15:04:56,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:04:56,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test5-1.i that has 6 procedures, 587 locations, 1 initial locations, 46 loop locations, and 10 error locations. [2025-03-04 15:04:56,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:04:56,975 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;@3f55b98b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:04:56,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 15:04:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 579 states, 552 states have (on average 1.6268115942028984) internal successors, (898), 569 states have internal predecessors, (898), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 15:04:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 15:04:56,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:56,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:04:56,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:04:56,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash 976518152, now seen corresponding path program 1 times [2025-03-04 15:04:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:56,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948521088] [2025-03-04 15:04:56,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:56,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:57,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:04:57,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:04:57,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:57,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:57,096 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-04 15:04:57,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:57,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948521088] [2025-03-04 15:04:57,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948521088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:57,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:57,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:04:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689796276] [2025-03-04 15:04:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:57,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 15:04:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:57,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:04:57,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:04:57,115 INFO L87 Difference]: Start difference. First operand has 579 states, 552 states have (on average 1.6268115942028984) internal successors, (898), 569 states have internal predecessors, (898), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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-04 15:04:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:57,256 INFO L93 Difference]: Finished difference Result 1152 states and 1850 transitions. [2025-03-04 15:04:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:04:57,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-03-04 15:04:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:57,267 INFO L225 Difference]: With dead ends: 1152 [2025-03-04 15:04:57,269 INFO L226 Difference]: Without dead ends: 569 [2025-03-04 15:04:57,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-04 15:04:57,276 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:57,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 772 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:04:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-04 15:04:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-04 15:04:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 548 states have (on average 1.4708029197080292) internal successors, (806), 560 states have internal predecessors, (806), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 15:04:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 828 transitions. [2025-03-04 15:04:57,336 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 828 transitions. Word has length 5 [2025-03-04 15:04:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:57,337 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 828 transitions. [2025-03-04 15:04:57,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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-04 15:04:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 828 transitions. [2025-03-04 15:04:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 15:04:57,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:57,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:04:57,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:04:57,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:04:57,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash 207291934, now seen corresponding path program 1 times [2025-03-04 15:04:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:57,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771664944] [2025-03-04 15:04:57,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:57,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:04:57,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:04:57,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:57,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:57,388 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-04 15:04:57,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771664944] [2025-03-04 15:04:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771664944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:57,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:57,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:04:57,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800760254] [2025-03-04 15:04:57,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:57,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:04:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:57,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:04:57,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:04:57,391 INFO L87 Difference]: Start difference. First operand 569 states and 828 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04 15:04:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:57,610 INFO L93 Difference]: Finished difference Result 1299 states and 1905 transitions. [2025-03-04 15:04:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:04:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-04 15:04:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:57,614 INFO L225 Difference]: With dead ends: 1299 [2025-03-04 15:04:57,615 INFO L226 Difference]: Without dead ends: 1120 [2025-03-04 15:04:57,615 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-04 15:04:57,616 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 786 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:57,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1587 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:04:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2025-03-04 15:04:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 743. [2025-03-04 15:04:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 717 states have (on average 1.4741980474198046) internal successors, (1057), 734 states have internal predecessors, (1057), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 15:04:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1089 transitions. [2025-03-04 15:04:57,655 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1089 transitions. Word has length 6 [2025-03-04 15:04:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:57,655 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1089 transitions. [2025-03-04 15:04:57,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04 15:04:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1089 transitions. [2025-03-04 15:04:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 15:04:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:57,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:57,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:04:57,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:04:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash 781132950, now seen corresponding path program 1 times [2025-03-04 15:04:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151073939] [2025-03-04 15:04:57,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:57,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 15:04:57,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 15:04:57,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:57,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:58,169 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-04 15:04:58,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:58,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151073939] [2025-03-04 15:04:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151073939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:58,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:04:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364740999] [2025-03-04 15:04:58,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:04:58,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:58,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:04:58,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:04:58,170 INFO L87 Difference]: Start difference. First operand 743 states and 1089 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-04 15:04:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:58,349 INFO L93 Difference]: Finished difference Result 1482 states and 2174 transitions. [2025-03-04 15:04:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:04:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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 147 [2025-03-04 15:04:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:58,353 INFO L225 Difference]: With dead ends: 1482 [2025-03-04 15:04:58,353 INFO L226 Difference]: Without dead ends: 746 [2025-03-04 15:04:58,354 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-04 15:04:58,355 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 105 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:58,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2130 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:04:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-04 15:04:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 743. [2025-03-04 15:04:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 717 states have (on average 1.4644351464435146) internal successors, (1050), 734 states have internal predecessors, (1050), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 15:04:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1082 transitions. [2025-03-04 15:04:58,391 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1082 transitions. Word has length 147 [2025-03-04 15:04:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:58,391 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1082 transitions. [2025-03-04 15:04:58,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-04 15:04:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1082 transitions. [2025-03-04 15:04:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 15:04:58,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:58,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:58,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:04:58,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:04:58,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1767330083, now seen corresponding path program 1 times [2025-03-04 15:04:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:58,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041204702] [2025-03-04 15:04:58,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:58,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 15:04:58,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 15:04:58,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:58,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:58,587 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-04 15:04:58,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:58,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041204702] [2025-03-04 15:04:58,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041204702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:58,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:58,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:04:58,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510819750] [2025-03-04 15:04:58,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:58,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:04:58,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:58,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:04:58,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:04:58,589 INFO L87 Difference]: Start difference. First operand 743 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-04 15:04:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:58,709 INFO L93 Difference]: Finished difference Result 1485 states and 2166 transitions. [2025-03-04 15:04:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:04:58,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2025-03-04 15:04:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:58,713 INFO L225 Difference]: With dead ends: 1485 [2025-03-04 15:04:58,713 INFO L226 Difference]: Without dead ends: 749 [2025-03-04 15:04:58,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 15:04:58,714 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:58,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1482 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:04:58,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-04 15:04:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2025-03-04 15:04:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 723 states have (on average 1.4605809128630705) internal successors, (1056), 740 states have internal predecessors, (1056), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 15:04:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1088 transitions. [2025-03-04 15:04:58,733 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1088 transitions. Word has length 147 [2025-03-04 15:04:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:58,733 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1088 transitions. [2025-03-04 15:04:58,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-04 15:04:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1088 transitions. [2025-03-04 15:04:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 15:04:58,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:58,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:58,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:04:58,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:04:58,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:58,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1126243940, now seen corresponding path program 1 times [2025-03-04 15:04:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205718945] [2025-03-04 15:04:58,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:58,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 15:04:58,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 15:04:58,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:58,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:58,948 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-04 15:04:58,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:58,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205718945] [2025-03-04 15:04:58,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205718945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:58,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:58,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:04:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395098598] [2025-03-04 15:04:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:58,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:04:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:58,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:04:58,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:04:58,949 INFO L87 Difference]: Start difference. First operand 749 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-04 15:04:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:59,084 INFO L93 Difference]: Finished difference Result 1622 states and 2360 transitions. [2025-03-04 15:04:59,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:04:59,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2025-03-04 15:04:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:59,089 INFO L225 Difference]: With dead ends: 1622 [2025-03-04 15:04:59,090 INFO L226 Difference]: Without dead ends: 880 [2025-03-04 15:04:59,091 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-04 15:04:59,092 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 134 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:59,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1507 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:04:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-04 15:04:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2025-03-04 15:04:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 854 states have (on average 1.459016393442623) internal successors, (1246), 871 states have internal predecessors, (1246), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 15:04:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1278 transitions. [2025-03-04 15:04:59,113 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1278 transitions. Word has length 147 [2025-03-04 15:04:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:59,114 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1278 transitions. [2025-03-04 15:04:59,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-04 15:04:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1278 transitions. [2025-03-04 15:04:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 15:04:59,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:59,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:59,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:04:59,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:04:59,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:59,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1048004991, now seen corresponding path program 1 times [2025-03-04 15:04:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:59,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386371565] [2025-03-04 15:04:59,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:59,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:59,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 15:04:59,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 15:04:59,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:59,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:59,419 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-04 15:04:59,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:59,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386371565] [2025-03-04 15:04:59,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386371565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:59,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:59,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:04:59,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659807094] [2025-03-04 15:04:59,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:59,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:04:59,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:59,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:04:59,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:04:59,421 INFO L87 Difference]: Start difference. First operand 880 states and 1278 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-04 15:04:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:59,588 INFO L93 Difference]: Finished difference Result 1580 states and 2293 transitions. [2025-03-04 15:04:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:04:59,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 162 [2025-03-04 15:04:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:59,592 INFO L225 Difference]: With dead ends: 1580 [2025-03-04 15:04:59,592 INFO L226 Difference]: Without dead ends: 838 [2025-03-04 15:04:59,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:04:59,593 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 30 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:59,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1979 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:04:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-04 15:04:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-03-04 15:04:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 812 states have (on average 1.4396551724137931) internal successors, (1169), 829 states have internal predecessors, (1169), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 15:04:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1201 transitions. [2025-03-04 15:04:59,608 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1201 transitions. Word has length 162 [2025-03-04 15:04:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:59,608 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1201 transitions. [2025-03-04 15:04:59,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-04 15:04:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1201 transitions. [2025-03-04 15:04:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 15:04:59,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:59,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:59,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:04:59,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:04:59,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash -259268613, now seen corresponding path program 1 times [2025-03-04 15:04:59,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:59,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011217954] [2025-03-04 15:04:59,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:59,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:59,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 15:04:59,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 15:04:59,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:59,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:59,798 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-04 15:04:59,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011217954] [2025-03-04 15:04:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011217954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:59,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:59,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:04:59,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672518314] [2025-03-04 15:04:59,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:59,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:04:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:59,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:04:59,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:04:59,800 INFO L87 Difference]: Start difference. First operand 838 states and 1201 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-04 15:04:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:59,954 INFO L93 Difference]: Finished difference Result 1854 states and 2662 transitions. [2025-03-04 15:04:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:04:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 162 [2025-03-04 15:04:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:59,959 INFO L225 Difference]: With dead ends: 1854 [2025-03-04 15:04:59,959 INFO L226 Difference]: Without dead ends: 1154 [2025-03-04 15:04:59,960 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-04 15:04:59,960 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 460 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:59,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1529 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:04:59,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-03-04 15:04:59,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1149. [2025-03-04 15:04:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1110 states have (on average 1.4396396396396396) internal successors, (1598), 1137 states have internal predecessors, (1598), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 13 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 15:04:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1656 transitions. [2025-03-04 15:04:59,983 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1656 transitions. Word has length 162 [2025-03-04 15:04:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:59,984 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1656 transitions. [2025-03-04 15:04:59,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-04 15:04:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1656 transitions. [2025-03-04 15:04:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 15:04:59,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:59,985 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:59,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:04:59,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:04:59,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1749667785, now seen corresponding path program 1 times [2025-03-04 15:04:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825666569] [2025-03-04 15:04:59,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:00,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 15:05:00,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 15:05:00,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:00,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:05:00,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825666569] [2025-03-04 15:05:00,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825666569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:00,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:05:00,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:05:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293551469] [2025-03-04 15:05:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:00,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:05:00,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:00,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:05:00,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:05:00,272 INFO L87 Difference]: Start difference. First operand 1149 states and 1656 transitions. Second operand has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:00,446 INFO L93 Difference]: Finished difference Result 1216 states and 1741 transitions. [2025-03-04 15:05:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:05:00,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 177 [2025-03-04 15:05:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:00,451 INFO L225 Difference]: With dead ends: 1216 [2025-03-04 15:05:00,451 INFO L226 Difference]: Without dead ends: 1214 [2025-03-04 15:05:00,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:05:00,451 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 538 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:00,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2085 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:05:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-04 15:05:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1212. [2025-03-04 15:05:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1170 states have (on average 1.4316239316239316) internal successors, (1675), 1197 states have internal predecessors, (1675), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 15:05:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1739 transitions. [2025-03-04 15:05:00,472 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1739 transitions. Word has length 177 [2025-03-04 15:05:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:00,473 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1739 transitions. [2025-03-04 15:05:00,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1739 transitions. [2025-03-04 15:05:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-04 15:05:00,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:00,474 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:00,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:05:00,475 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:00,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:00,475 INFO L85 PathProgramCache]: Analyzing trace with hash 920429147, now seen corresponding path program 1 times [2025-03-04 15:05:00,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:00,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843530045] [2025-03-04 15:05:00,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:00,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 15:05:01,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 15:05:01,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:01,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:05:01,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:01,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843530045] [2025-03-04 15:05:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843530045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:01,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090660144] [2025-03-04 15:05:01,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:01,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:01,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:01,305 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-04 15:05:01,307 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-04 15:05:01,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 15:05:01,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 15:05:01,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:01,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:01,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 15:05:01,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:01,796 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-04 15:05:01,810 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-04 15:05:02,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:05:02,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-03-04 15:05:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:05:02,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:05:02,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090660144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:02,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:05:02,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 15:05:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406580968] [2025-03-04 15:05:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:02,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:05:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:02,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:05:02,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:05:02,402 INFO L87 Difference]: Start difference. First operand 1212 states and 1739 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:06,639 INFO L93 Difference]: Finished difference Result 2371 states and 3396 transitions. [2025-03-04 15:05:06,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:05:06,640 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2025-03-04 15:05:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:06,646 INFO L225 Difference]: With dead ends: 2371 [2025-03-04 15:05:06,646 INFO L226 Difference]: Without dead ends: 1250 [2025-03-04 15:05:06,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:05:06,649 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 955 mSDsluCounter, 4409 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 5110 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:06,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 5110 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-04 15:05:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-04 15:05:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1243. [2025-03-04 15:05:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1201 states have (on average 1.424646128226478) internal successors, (1711), 1228 states have internal predecessors, (1711), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 15:05:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1775 transitions. [2025-03-04 15:05:06,680 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1775 transitions. Word has length 183 [2025-03-04 15:05:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:06,680 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1775 transitions. [2025-03-04 15:05:06,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1775 transitions. [2025-03-04 15:05:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 15:05:06,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:06,682 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:06,693 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-04 15:05:06,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:06,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:06,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:06,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1291215358, now seen corresponding path program 1 times [2025-03-04 15:05:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:06,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678790482] [2025-03-04 15:05:06,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:06,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:06,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 15:05:07,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 15:05:07,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:07,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:05:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678790482] [2025-03-04 15:05:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678790482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624137980] [2025-03-04 15:05:07,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:07,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:07,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:07,605 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-04 15:05:07,607 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-04 15:05:07,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 15:05:08,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 15:05:08,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:08,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:08,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:05:08,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:05:08,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:05:08,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624137980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:08,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:05:08,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:05:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480051665] [2025-03-04 15:05:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:08,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:05:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:08,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:05:08,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:05:08,177 INFO L87 Difference]: Start difference. First operand 1243 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:08,456 INFO L93 Difference]: Finished difference Result 2413 states and 3453 transitions. [2025-03-04 15:05:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:05:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-04 15:05:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:08,462 INFO L225 Difference]: With dead ends: 2413 [2025-03-04 15:05:08,462 INFO L226 Difference]: Without dead ends: 1292 [2025-03-04 15:05:08,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:05:08,464 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 17 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:08,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1862 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:05:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-03-04 15:05:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1276. [2025-03-04 15:05:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1234 states have (on average 1.4181523500810373) internal successors, (1750), 1261 states have internal predecessors, (1750), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 15:05:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1814 transitions. [2025-03-04 15:05:08,499 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1814 transitions. Word has length 184 [2025-03-04 15:05:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:08,500 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1814 transitions. [2025-03-04 15:05:08,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1814 transitions. [2025-03-04 15:05:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 15:05:08,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:08,502 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:08,513 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-04 15:05:08,707 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,SelfDestructingSolverStorable9 [2025-03-04 15:05:08,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash -893399208, now seen corresponding path program 1 times [2025-03-04 15:05:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283186614] [2025-03-04 15:05:08,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:08,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 15:05:08,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 15:05:08,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:05:09,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:09,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283186614] [2025-03-04 15:05:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283186614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:09,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:05:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:05:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336742951] [2025-03-04 15:05:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:09,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:05:09,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:09,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:05:09,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:05:09,143 INFO L87 Difference]: Start difference. First operand 1276 states and 1814 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:09,622 INFO L93 Difference]: Finished difference Result 2438 states and 3478 transitions. [2025-03-04 15:05:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:05:09,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-04 15:05:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:09,626 INFO L225 Difference]: With dead ends: 2438 [2025-03-04 15:05:09,627 INFO L226 Difference]: Without dead ends: 1288 [2025-03-04 15:05:09,628 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-04 15:05:09,629 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 8 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:09,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2903 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 15:05:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-03-04 15:05:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1284. [2025-03-04 15:05:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1242 states have (on average 1.4170692431561998) internal successors, (1760), 1269 states have internal predecessors, (1760), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 15:05:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1824 transitions. [2025-03-04 15:05:09,659 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1824 transitions. Word has length 185 [2025-03-04 15:05:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:09,659 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1824 transitions. [2025-03-04 15:05:09,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1824 transitions. [2025-03-04 15:05:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 15:05:09,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:09,661 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:09,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:05:09,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:09,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1855472770, now seen corresponding path program 1 times [2025-03-04 15:05:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318729841] [2025-03-04 15:05:09,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:09,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 15:05:09,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 15:05:09,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:09,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:05:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318729841] [2025-03-04 15:05:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318729841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:10,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:05:10,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:05:10,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101052763] [2025-03-04 15:05:10,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:10,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:05:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:10,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:05:10,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:05:10,050 INFO L87 Difference]: Start difference. First operand 1284 states and 1824 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:10,614 INFO L93 Difference]: Finished difference Result 2453 states and 3498 transitions. [2025-03-04 15:05:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:05:10,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-04 15:05:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:10,620 INFO L225 Difference]: With dead ends: 2453 [2025-03-04 15:05:10,620 INFO L226 Difference]: Without dead ends: 1306 [2025-03-04 15:05:10,622 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-04 15:05:10,622 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 12 mSDsluCounter, 2788 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:10,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3455 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 15:05:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2025-03-04 15:05:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1300. [2025-03-04 15:05:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1258 states have (on average 1.4165341812400636) internal successors, (1782), 1285 states have internal predecessors, (1782), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 15:05:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1846 transitions. [2025-03-04 15:05:10,649 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1846 transitions. Word has length 186 [2025-03-04 15:05:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:10,649 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1846 transitions. [2025-03-04 15:05:10,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1846 transitions. [2025-03-04 15:05:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 15:05:10,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:10,651 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:10,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:05:10,651 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:10,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash -559608483, now seen corresponding path program 1 times [2025-03-04 15:05:10,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:10,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385663706] [2025-03-04 15:05:10,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:10,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:10,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 15:05:10,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 15:05:10,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:10,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:05:11,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:11,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385663706] [2025-03-04 15:05:11,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385663706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:11,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027762352] [2025-03-04 15:05:11,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:11,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:11,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:11,187 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-04 15:05:11,189 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-04 15:05:11,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 15:05:11,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 15:05:11,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:11,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:11,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:05:11,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:05:11,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:05:11,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027762352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:11,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:05:11,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 15:05:11,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658226627] [2025-03-04 15:05:11,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:11,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:05:11,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:11,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:05:11,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:05:11,848 INFO L87 Difference]: Start difference. First operand 1300 states and 1846 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:05:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:11,973 INFO L93 Difference]: Finished difference Result 2418 states and 3453 transitions. [2025-03-04 15:05:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:05:11,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2025-03-04 15:05:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:11,980 INFO L225 Difference]: With dead ends: 2418 [2025-03-04 15:05:11,980 INFO L226 Difference]: Without dead ends: 1303 [2025-03-04 15:05:11,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:05:11,983 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 0 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:11,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2033 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:05:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-04 15:05:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1303. [2025-03-04 15:05:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1260 states have (on average 1.4166666666666667) internal successors, (1785), 1288 states have internal predecessors, (1785), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1853 transitions. [2025-03-04 15:05:12,011 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1853 transitions. Word has length 186 [2025-03-04 15:05:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:12,011 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1853 transitions. [2025-03-04 15:05:12,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:05:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1853 transitions. [2025-03-04 15:05:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 15:05:12,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:12,013 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:12,026 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-04 15:05:12,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:12,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:12,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash -286597467, now seen corresponding path program 1 times [2025-03-04 15:05:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513058605] [2025-03-04 15:05:12,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:12,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 15:05:12,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 15:05:12,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:12,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:05:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513058605] [2025-03-04 15:05:12,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513058605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205500140] [2025-03-04 15:05:12,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:12,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:12,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:12,776 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-04 15:05:12,778 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-04 15:05:13,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 15:05:13,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 15:05:13,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:13,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:13,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 167 conjuncts are in the unsatisfiable core [2025-03-04 15:05:13,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:13,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:05:13,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04 15:05:13,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-03-04 15:05:13,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-04 15:05:13,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04 15:05:13,781 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 15:05:13,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 15:05:13,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:05:13,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 15:05:13,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 15:05:13,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 15:05:13,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 15:05:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:05:14,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:05:15,300 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3603 (Array Int Int)) (v_z_10 Int) (v_z_9 Int) (v_z_8 Int)) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 255 v_z_8) (< 0 (mod (+ (* v_z_10 16777216) (* 256 v_z_8) 17973517 (mod (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~_ha_head~0#1.base| v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* 65536 v_z_9)) 4294967296)) (< 255 v_z_9))) is different from false [2025-03-04 15:05:15,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse13)) (.cse12 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse13))) (let ((.cse0 (mod |c_ULTIMATE.start_main_~_ha_bkt~0#1| 4294967296)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse12))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) (.cse7 (select |c_#memory_int#1| .cse1)) (.cse8 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24)) (.cse9 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12)) (.cse5 (* .cse0 12))) (and (or (< 2147483647 .cse0) (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse3 (+ .cse4 .cse5 4))) (or (< v_z_10 0) (< 0 (mod (+ (* v_z_10 16777216) (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 .cse3 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse1) (+ .cse4 .cse5)) v_ArrVal_3602) .cse1 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 256) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 255 v_z_8) (not (= v_ArrVal_3595 (store (store (select (store |c_#memory_int#1| .cse1 (store .cse7 .cse3 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8 (select v_ArrVal_3595 .cse8)) .cse9 (select v_ArrVal_3595 .cse9)))) (< 255 v_z_9))))) (or (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse10 (+ .cse4 .cse5 (- 51539607548)))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 0 (mod (+ (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 .cse10 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse1) (+ .cse4 (- 51539607552) .cse5)) v_ArrVal_3602) .cse1 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_8) (not (= (store (store (select (store |c_#memory_int#1| .cse1 (store .cse7 .cse10 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8 (select v_ArrVal_3595 .cse8)) .cse9 (select v_ArrVal_3595 .cse9)) v_ArrVal_3595)) (< 255 v_z_9)))) (< .cse0 2147483648))))))) is different from false [2025-03-04 15:05:15,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse13)) (.cse12 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse13))) (let ((.cse9 (mod |c_ULTIMATE.start_main_#t~bitwise78#1| 4294967296)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse12))) (let ((.cse1 (select |c_#memory_int#1| .cse0)) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse8 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12)) (.cse7 (* .cse9 12))) (and (or (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse2 (+ .cse6 .cse7 4))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (not (= v_ArrVal_3595 (store (store (select (store |c_#memory_int#1| .cse0 (store .cse1 .cse2 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select v_ArrVal_3595 .cse3)) .cse4 (select v_ArrVal_3595 .cse4)))) (< 0 (mod (+ (* v_z_10 16777216) (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse5 .cse2 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse0) (+ .cse6 .cse7)) v_ArrVal_3602) .cse0 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) 256) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_8) (< 255 v_z_9)))) (< 2147483647 .cse9)) (or (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse10 (+ .cse6 .cse7 (- 51539607548)))) (or (< v_z_10 0) (not (= v_ArrVal_3595 (store (store (select (store |c_#memory_int#1| .cse0 (store .cse1 .cse10 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select v_ArrVal_3595 .cse3)) .cse4 (select v_ArrVal_3595 .cse4)))) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 0 (mod (+ (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse5 .cse10 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse0) (+ .cse6 (- 51539607552) .cse7)) v_ArrVal_3602) .cse0 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_8) (< 255 v_z_9)))) (< .cse9 2147483648))))))) is different from false [2025-03-04 15:05:15,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse7)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse7))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) (.cse1 (+ .cse2 4))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 0 (mod (+ (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse0) .cse2) v_ArrVal_3602) .cse0 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_8) (not (= v_ArrVal_3595 (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20))) (store (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24))) (store (select (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select v_ArrVal_3595 .cse3))) .cse4 (select v_ArrVal_3595 .cse4))))) (< 255 v_z_9))))))) is different from false [2025-03-04 15:05:16,099 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int)) (v_z_10 Int) (v_z_9 Int) (v_ArrVal_3592 Int) (v_ArrVal_3590 (Array Int Int)) (v_z_8 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12) 12))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 v_ArrVal_3592))) (.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3590))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~users~0#1.base|) .cse12))) (let ((.cse8 (select (select .cse11 .cse9) .cse10))) (let ((.cse2 (store |c_#memory_int#1| .cse0 v_ArrVal_3593)) (.cse4 (+ .cse8 4)) (.cse3 (select (select .cse7 .cse9) .cse10))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (not (= v_ArrVal_3590 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 (select v_ArrVal_3590 .cse1)))) (not (= (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20))) (store (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24))) (store (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5 (select v_ArrVal_3595 .cse5))) .cse6 (select v_ArrVal_3595 .cse6))) v_ArrVal_3595)) (< 255 v_z_8) (< 0 (mod (+ (mod (select (select (store (store (store .cse2 |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse3) .cse8) v_ArrVal_3602) .cse3 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_9))))))))) is different from false [2025-03-04 15:05:16,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int)) (v_z_10 Int) (v_z_9 Int) (v_ArrVal_3592 Int) (v_ArrVal_3590 (Array Int Int)) (v_z_8 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse12)) (.cse8 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse12) 12))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse7 (store (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8 v_ArrVal_3592))) (.cse1 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3590))) (let ((.cse9 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse12)) (.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse12))) (let ((.cse4 (select (select .cse11 .cse9) .cse10))) (let ((.cse0 (store |c_#memory_int#1| .cse7 v_ArrVal_3593)) (.cse2 (select (select .cse1 .cse9) .cse10)) (.cse3 (+ .cse4 4))) (or (< v_z_10 0) (< 0 (mod (+ (* v_z_10 16777216) (* 256 v_z_8) 17973517 (mod (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse2) .cse4) v_ArrVal_3602) .cse2 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* 65536 v_z_9)) 4294967296)) (not (= v_ArrVal_3595 (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20))) (store (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24))) (store (select (store .cse0 .cse2 (store (select .cse0 .cse2) .cse3 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5 (select v_ArrVal_3595 .cse5))) .cse6 (select v_ArrVal_3595 .cse6))))) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 255 v_z_8) (not (= (store (select |c_#memory_$Pointer$#1.base| .cse7) .cse8 (select v_ArrVal_3590 .cse8)) v_ArrVal_3590)) (< 255 v_z_9))))))))) is different from false [2025-03-04 15:05:16,656 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3609 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_z_10 Int) (v_z_9 Int) (v_ArrVal_3592 Int) (v_ArrVal_3590 (Array Int Int)) (v_z_8 Int) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem63#1.base| v_ArrVal_3610)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem63#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem63#1.base|) |c_ULTIMATE.start_main_#t~mem63#1.offset| 0))) (.cse13 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse13)) (.cse7 (+ (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse13) 12))) (let ((.cse12 (store .cse14 .cse6 (store (select .cse14 .cse6) .cse7 v_ArrVal_3592))) (.cse8 (store .cse5 .cse6 v_ArrVal_3590))) (let ((.cse10 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse13)) (.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse13))) (let ((.cse9 (select (select .cse12 .cse10) .cse11))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem63#1.base| v_ArrVal_3609) .cse6 v_ArrVal_3593)) (.cse2 (+ .cse9 4)) (.cse1 (select (select .cse8 .cse10) .cse11))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20))) (store (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24))) (store (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select v_ArrVal_3595 .cse3))) .cse4 (select v_ArrVal_3595 .cse4))) v_ArrVal_3595)) (< 255 v_z_8) (not (= v_ArrVal_3590 (store (select .cse5 .cse6) .cse7 (select v_ArrVal_3590 .cse7)))) (< 0 (mod (+ (mod (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse1) .cse9) v_ArrVal_3602) .cse1 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_9))))))))) is different from false [2025-03-04 15:05:16,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205500140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:16,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:05:16,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2025-03-04 15:05:16,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114502244] [2025-03-04 15:05:16,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 15:05:16,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 15:05:16,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:16,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:05:16,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=442, Unknown=13, NotChecked=336, Total=870 [2025-03-04 15:05:16,664 INFO L87 Difference]: Start difference. First operand 1303 states and 1853 transitions. Second operand has 14 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 15:05:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:19,759 INFO L93 Difference]: Finished difference Result 2582 states and 3668 transitions. [2025-03-04 15:05:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:05:19,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) Word has length 190 [2025-03-04 15:05:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:19,764 INFO L225 Difference]: With dead ends: 2582 [2025-03-04 15:05:19,764 INFO L226 Difference]: Without dead ends: 1460 [2025-03-04 15:05:19,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=657, Unknown=13, NotChecked=406, Total=1190 [2025-03-04 15:05:19,766 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 998 mSDsluCounter, 5410 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 6029 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:19,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 6029 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 15:05:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2025-03-04 15:05:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1312. [2025-03-04 15:05:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1268 states have (on average 1.416403785488959) internal successors, (1796), 1295 states have internal predecessors, (1796), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1864 transitions. [2025-03-04 15:05:19,789 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1864 transitions. Word has length 190 [2025-03-04 15:05:19,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:19,789 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1864 transitions. [2025-03-04 15:05:19,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 15:05:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1864 transitions. [2025-03-04 15:05:19,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 15:05:19,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:19,791 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:19,801 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-04 15:05:19,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:19,992 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:19,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:19,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1225807933, now seen corresponding path program 2 times [2025-03-04 15:05:19,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:19,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023700550] [2025-03-04 15:05:19,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:05:19,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:20,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-03-04 15:05:20,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 15:05:20,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:05:20,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:05:20,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:20,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023700550] [2025-03-04 15:05:20,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023700550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008869675] [2025-03-04 15:05:20,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:05:20,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:20,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:20,665 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-04 15:05:20,666 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-04 15:05:21,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-03-04 15:05:21,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 15:05:21,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:05:21,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:21,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:05:21,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:05:21,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:05:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008869675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:21,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:05:21,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 15:05:21,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491220575] [2025-03-04 15:05:21,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:21,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:05:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:21,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:05:21,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:05:21,556 INFO L87 Difference]: Start difference. First operand 1312 states and 1864 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:22,134 INFO L93 Difference]: Finished difference Result 2493 states and 3555 transitions. [2025-03-04 15:05:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:05:22,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2025-03-04 15:05:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:22,139 INFO L225 Difference]: With dead ends: 2493 [2025-03-04 15:05:22,140 INFO L226 Difference]: Without dead ends: 1326 [2025-03-04 15:05:22,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:05:22,142 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 12 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3461 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:22,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3461 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 15:05:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-03-04 15:05:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1312. [2025-03-04 15:05:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1268 states have (on average 1.416403785488959) internal successors, (1796), 1295 states have internal predecessors, (1796), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1864 transitions. [2025-03-04 15:05:22,168 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1864 transitions. Word has length 192 [2025-03-04 15:05:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:22,169 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1864 transitions. [2025-03-04 15:05:22,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1864 transitions. [2025-03-04 15:05:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 15:05:22,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:22,170 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:22,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:05:22,371 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,SelfDestructingSolverStorable14 [2025-03-04 15:05:22,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:22,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash -699315049, now seen corresponding path program 1 times [2025-03-04 15:05:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:22,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946565574] [2025-03-04 15:05:22,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:22,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:22,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 15:05:22,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 15:05:22,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:22,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:05:22,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:22,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946565574] [2025-03-04 15:05:22,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946565574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:22,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:05:22,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:05:22,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133529834] [2025-03-04 15:05:22,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:22,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:05:22,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:22,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:05:22,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:05:22,762 INFO L87 Difference]: Start difference. First operand 1312 states and 1864 transitions. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:23,273 INFO L93 Difference]: Finished difference Result 2500 states and 3561 transitions. [2025-03-04 15:05:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:05:23,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2025-03-04 15:05:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:23,278 INFO L225 Difference]: With dead ends: 2500 [2025-03-04 15:05:23,278 INFO L226 Difference]: Without dead ends: 1338 [2025-03-04 15:05:23,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:05:23,280 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 20 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3594 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:23,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3594 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 15:05:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-04 15:05:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1326. [2025-03-04 15:05:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1282 states have (on average 1.4149765990639624) internal successors, (1814), 1309 states have internal predecessors, (1814), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1882 transitions. [2025-03-04 15:05:23,304 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1882 transitions. Word has length 193 [2025-03-04 15:05:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:23,304 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1882 transitions. [2025-03-04 15:05:23,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:23,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1882 transitions. [2025-03-04 15:05:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 15:05:23,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:23,306 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:23,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:05:23,306 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:23,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1456271832, now seen corresponding path program 1 times [2025-03-04 15:05:23,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:23,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813257717] [2025-03-04 15:05:23,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:23,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 15:05:23,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 15:05:23,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:23,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:05:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813257717] [2025-03-04 15:05:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813257717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620328924] [2025-03-04 15:05:24,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:24,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:24,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:24,166 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-04 15:05:24,168 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-04 15:05:24,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 15:05:24,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 15:05:24,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:24,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:24,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:05:24,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:05:24,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:05:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620328924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:05:24,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2025-03-04 15:05:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583652669] [2025-03-04 15:05:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:24,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:05:24,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:24,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:05:24,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:05:24,871 INFO L87 Difference]: Start difference. First operand 1326 states and 1882 transitions. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:26,186 INFO L93 Difference]: Finished difference Result 2521 states and 3588 transitions. [2025-03-04 15:05:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:05:26,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2025-03-04 15:05:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:26,190 INFO L225 Difference]: With dead ends: 2521 [2025-03-04 15:05:26,190 INFO L226 Difference]: Without dead ends: 1352 [2025-03-04 15:05:26,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:05:26,191 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 17 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:26,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4053 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 15:05:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-04 15:05:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1336. [2025-03-04 15:05:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1292 states have (on average 1.4133126934984521) internal successors, (1826), 1319 states have internal predecessors, (1826), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1894 transitions. [2025-03-04 15:05:26,211 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1894 transitions. Word has length 193 [2025-03-04 15:05:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:26,211 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1894 transitions. [2025-03-04 15:05:26,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1894 transitions. [2025-03-04 15:05:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 15:05:26,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:26,213 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:26,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:05:26,413 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,SelfDestructingSolverStorable16 [2025-03-04 15:05:26,414 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash 289161245, now seen corresponding path program 1 times [2025-03-04 15:05:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892519491] [2025-03-04 15:05:26,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:26,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 15:05:26,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 15:05:26,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:26,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:05:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:26,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892519491] [2025-03-04 15:05:26,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892519491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:26,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:05:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 15:05:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759448951] [2025-03-04 15:05:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:26,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:05:26,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:26,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:05:26,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:05:26,811 INFO L87 Difference]: Start difference. First operand 1336 states and 1894 transitions. Second operand has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:27,413 INFO L93 Difference]: Finished difference Result 2533 states and 3604 transitions. [2025-03-04 15:05:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:05:27,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 194 [2025-03-04 15:05:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:27,417 INFO L225 Difference]: With dead ends: 2533 [2025-03-04 15:05:27,417 INFO L226 Difference]: Without dead ends: 1354 [2025-03-04 15:05:27,418 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-04 15:05:27,418 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 23 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4662 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:27,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4662 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 15:05:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-04 15:05:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1342. [2025-03-04 15:05:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1298 states have (on average 1.411402157164869) internal successors, (1832), 1325 states have internal predecessors, (1832), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1900 transitions. [2025-03-04 15:05:27,436 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1900 transitions. Word has length 194 [2025-03-04 15:05:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:27,436 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1900 transitions. [2025-03-04 15:05:27,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1900 transitions. [2025-03-04 15:05:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 15:05:27,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:27,437 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:27,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:05:27,437 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:27,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1607122180, now seen corresponding path program 1 times [2025-03-04 15:05:27,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:27,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862015590] [2025-03-04 15:05:27,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:27,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:27,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 15:05:27,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 15:05:27,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:27,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:05:28,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:28,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862015590] [2025-03-04 15:05:28,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862015590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:28,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429709478] [2025-03-04 15:05:28,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:28,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:28,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:28,153 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-04 15:05:28,154 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-04 15:05:28,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 15:05:28,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 15:05:28,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:28,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:28,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 15:05:28,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 15:05:29,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:05:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429709478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:29,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:05:29,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-04 15:05:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007186671] [2025-03-04 15:05:29,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:29,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:05:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:29,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:05:29,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:05:29,040 INFO L87 Difference]: Start difference. First operand 1342 states and 1900 transitions. Second operand has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:05:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:29,413 INFO L93 Difference]: Finished difference Result 2410 states and 3439 transitions. [2025-03-04 15:05:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:05:29,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 194 [2025-03-04 15:05:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:29,417 INFO L225 Difference]: With dead ends: 2410 [2025-03-04 15:05:29,417 INFO L226 Difference]: Without dead ends: 1364 [2025-03-04 15:05:29,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:05:29,418 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 30 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:29,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4358 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 15:05:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-04 15:05:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1356. [2025-03-04 15:05:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1312 states have (on average 1.4085365853658536) internal successors, (1848), 1339 states have internal predecessors, (1848), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1916 transitions. [2025-03-04 15:05:29,450 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1916 transitions. Word has length 194 [2025-03-04 15:05:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:29,451 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1916 transitions. [2025-03-04 15:05:29,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:05:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1916 transitions. [2025-03-04 15:05:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 15:05:29,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:29,452 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:29,464 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-04 15:05:29,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:29,654 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:29,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash -250073338, now seen corresponding path program 1 times [2025-03-04 15:05:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589646895] [2025-03-04 15:05:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:29,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 15:05:29,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 15:05:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:05:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589646895] [2025-03-04 15:05:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589646895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:30,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:05:30,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:05:30,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174915606] [2025-03-04 15:05:30,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:30,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:05:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:30,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:05:30,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:05:30,039 INFO L87 Difference]: Start difference. First operand 1356 states and 1916 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:05:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:30,335 INFO L93 Difference]: Finished difference Result 2404 states and 3422 transitions. [2025-03-04 15:05:30,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:05:30,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 195 [2025-03-04 15:05:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:30,342 INFO L225 Difference]: With dead ends: 2404 [2025-03-04 15:05:30,342 INFO L226 Difference]: Without dead ends: 1352 [2025-03-04 15:05:30,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:05:30,344 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 13 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:30,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3093 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 15:05:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-04 15:05:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1350. [2025-03-04 15:05:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1306 states have (on average 1.4073506891271057) internal successors, (1838), 1333 states have internal predecessors, (1838), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1906 transitions. [2025-03-04 15:05:30,363 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1906 transitions. Word has length 195 [2025-03-04 15:05:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:30,364 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1906 transitions. [2025-03-04 15:05:30,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:05:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1906 transitions. [2025-03-04 15:05:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 15:05:30,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:30,365 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:30,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:05:30,365 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:30,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash -922101569, now seen corresponding path program 1 times [2025-03-04 15:05:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:30,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376376429] [2025-03-04 15:05:30,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:30,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 15:05:30,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 15:05:30,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:30,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:05:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376376429] [2025-03-04 15:05:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376376429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:30,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:05:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:05:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600833846] [2025-03-04 15:05:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:30,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:05:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:30,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:05:30,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:05:30,627 INFO L87 Difference]: Start difference. First operand 1350 states and 1906 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:05:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:30,860 INFO L93 Difference]: Finished difference Result 2403 states and 3419 transitions. [2025-03-04 15:05:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:05:30,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 196 [2025-03-04 15:05:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:30,864 INFO L225 Difference]: With dead ends: 2403 [2025-03-04 15:05:30,864 INFO L226 Difference]: Without dead ends: 1356 [2025-03-04 15:05:30,865 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-04 15:05:30,866 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 8 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:30,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3111 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:05:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-03-04 15:05:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2025-03-04 15:05:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1312 states have (on average 1.4054878048780488) internal successors, (1844), 1339 states have internal predecessors, (1844), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1912 transitions. [2025-03-04 15:05:30,879 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1912 transitions. Word has length 196 [2025-03-04 15:05:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:30,879 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1912 transitions. [2025-03-04 15:05:30,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:05:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1912 transitions. [2025-03-04 15:05:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 15:05:30,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:30,880 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:30,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:05:30,881 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:30,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 312634344, now seen corresponding path program 1 times [2025-03-04 15:05:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:30,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388258666] [2025-03-04 15:05:30,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:30,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 15:05:31,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 15:05:31,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:31,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:05:31,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:31,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388258666] [2025-03-04 15:05:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388258666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:31,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383976323] [2025-03-04 15:05:31,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:31,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:31,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:31,479 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-04 15:05:31,480 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-04 15:05:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 15:05:32,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 15:05:32,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:32,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:32,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:05:32,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:05:32,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:05:32,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383976323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:32,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:05:32,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-04 15:05:32,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933109897] [2025-03-04 15:05:32,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:32,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:05:32,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:32,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:05:32,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:05:32,355 INFO L87 Difference]: Start difference. First operand 1356 states and 1912 transitions. Second operand has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:33,527 INFO L93 Difference]: Finished difference Result 2576 states and 3648 transitions. [2025-03-04 15:05:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:05:33,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 197 [2025-03-04 15:05:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:33,531 INFO L225 Difference]: With dead ends: 2576 [2025-03-04 15:05:33,531 INFO L226 Difference]: Without dead ends: 1380 [2025-03-04 15:05:33,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:05:33,538 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 17 mSDsluCounter, 4515 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5187 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:33,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5187 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 15:05:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-04 15:05:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1370. [2025-03-04 15:05:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1326 states have (on average 1.4042232277526394) internal successors, (1862), 1353 states have internal predecessors, (1862), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1930 transitions. [2025-03-04 15:05:33,552 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1930 transitions. Word has length 197 [2025-03-04 15:05:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:33,552 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1930 transitions. [2025-03-04 15:05:33,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1930 transitions. [2025-03-04 15:05:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 15:05:33,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:33,553 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:33,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:05:33,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 15:05:33,754 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:33,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 48526664, now seen corresponding path program 1 times [2025-03-04 15:05:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:33,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119642062] [2025-03-04 15:05:33,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:33,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 15:05:33,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 15:05:33,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:33,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:05:34,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119642062] [2025-03-04 15:05:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119642062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71979019] [2025-03-04 15:05:34,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:34,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:34,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:34,156 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-04 15:05:34,157 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-04 15:05:34,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 15:05:34,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 15:05:34,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:34,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:34,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 15:05:34,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:05:34,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:05:34,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71979019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:34,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:05:34,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 15:05:34,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028682204] [2025-03-04 15:05:34,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:34,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:05:34,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:34,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:05:34,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:05:34,782 INFO L87 Difference]: Start difference. First operand 1370 states and 1930 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:05:35,156 INFO L93 Difference]: Finished difference Result 2596 states and 3672 transitions. [2025-03-04 15:05:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:05:35,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 197 [2025-03-04 15:05:35,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:05:35,160 INFO L225 Difference]: With dead ends: 2596 [2025-03-04 15:05:35,160 INFO L226 Difference]: Without dead ends: 1398 [2025-03-04 15:05:35,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:05:35,161 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 39 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 15:05:35,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3527 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 15:05:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-04 15:05:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1384. [2025-03-04 15:05:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1340 states have (on average 1.4044776119402984) internal successors, (1882), 1367 states have internal predecessors, (1882), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:05:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1950 transitions. [2025-03-04 15:05:35,178 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1950 transitions. Word has length 197 [2025-03-04 15:05:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:05:35,179 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1950 transitions. [2025-03-04 15:05:35,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:05:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1950 transitions. [2025-03-04 15:05:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 15:05:35,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:05:35,181 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:35,192 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-04 15:05:35,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:35,382 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:05:35,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:05:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash 747877252, now seen corresponding path program 1 times [2025-03-04 15:05:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:05:35,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992348226] [2025-03-04 15:05:35,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:05:35,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 15:05:36,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 15:05:36,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:36,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:05:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:05:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992348226] [2025-03-04 15:05:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992348226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:05:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95418556] [2025-03-04 15:05:36,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:05:36,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:05:36,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:05:36,343 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-04 15:05:36,344 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-04 15:05:36,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 15:05:37,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 15:05:37,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:05:37,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:05:37,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:05:37,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:05:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 15:05:48,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:05:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95418556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:05:48,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:05:48,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 15:05:48,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840062690] [2025-03-04 15:05:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:05:48,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:05:48,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:05:48,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:05:48,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:05:48,082 INFO L87 Difference]: Start difference. First operand 1384 states and 1950 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:05:52,633 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-04 15:05:54,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:05:55,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:05:59,904 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-04 15:06:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:06:00,169 INFO L93 Difference]: Finished difference Result 2451 states and 3480 transitions. [2025-03-04 15:06:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:06:00,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 197 [2025-03-04 15:06:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:06:00,172 INFO L225 Difference]: With dead ends: 2451 [2025-03-04 15:06:00,172 INFO L226 Difference]: Without dead ends: 1394 [2025-03-04 15:06:00,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:06:00,174 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 12 mSDsluCounter, 3044 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3710 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:06:00,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3710 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 672 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2025-03-04 15:06:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-04 15:06:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1392. [2025-03-04 15:06:00,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1348 states have (on average 1.403560830860534) internal successors, (1892), 1375 states have internal predecessors, (1892), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:06:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1960 transitions. [2025-03-04 15:06:00,188 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1960 transitions. Word has length 197 [2025-03-04 15:06:00,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:06:00,188 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1960 transitions. [2025-03-04 15:06:00,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:06:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1960 transitions. [2025-03-04 15:06:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 15:06:00,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:06:00,189 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:00,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:06:00,390 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,SelfDestructingSolverStorable23 [2025-03-04 15:06:00,390 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:06:00,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:06:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash 398231416, now seen corresponding path program 1 times [2025-03-04 15:06:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:06:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072275851] [2025-03-04 15:06:00,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:06:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:06:00,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 15:06:00,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 15:06:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:06:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:06:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:06:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:06:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072275851] [2025-03-04 15:06:00,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072275851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:06:00,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:06:00,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:06:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709396430] [2025-03-04 15:06:00,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:06:00,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:06:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:06:00,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:06:00,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:06:00,634 INFO L87 Difference]: Start difference. First operand 1392 states and 1960 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:06:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:06:01,030 INFO L93 Difference]: Finished difference Result 2463 states and 3495 transitions. [2025-03-04 15:06:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:06:01,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 197 [2025-03-04 15:06:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:06:01,034 INFO L225 Difference]: With dead ends: 2463 [2025-03-04 15:06:01,034 INFO L226 Difference]: Without dead ends: 1402 [2025-03-04 15:06:01,034 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-04 15:06:01,035 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 12 mSDsluCounter, 3045 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3716 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 15:06:01,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3716 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 15:06:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-04 15:06:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1392. [2025-03-04 15:06:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1348 states have (on average 1.403560830860534) internal successors, (1892), 1375 states have internal predecessors, (1892), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:06:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1960 transitions. [2025-03-04 15:06:01,048 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1960 transitions. Word has length 197 [2025-03-04 15:06:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:06:01,048 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1960 transitions. [2025-03-04 15:06:01,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:06:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1960 transitions. [2025-03-04 15:06:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 15:06:01,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:06:01,049 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:01,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:06:01,050 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:06:01,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:06:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1814514509, now seen corresponding path program 1 times [2025-03-04 15:06:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:06:01,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842618164] [2025-03-04 15:06:01,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:06:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:06:01,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 15:06:01,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 15:06:01,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:06:01,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:06:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:06:01,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:06:01,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842618164] [2025-03-04 15:06:01,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842618164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:06:01,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789734947] [2025-03-04 15:06:01,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:06:01,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:06:01,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:06:01,627 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-04 15:06:01,628 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-04 15:06:02,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 15:06:02,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 15:06:02,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:06:02,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:06:02,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 15:06:02,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:06:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:06:02,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:06:02,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789734947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:06:02,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:06:02,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 15:06:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923779890] [2025-03-04 15:06:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:06:02,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:06:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:06:02,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:06:02,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:06:02,408 INFO L87 Difference]: Start difference. First operand 1392 states and 1960 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:06:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:06:03,069 INFO L93 Difference]: Finished difference Result 2620 states and 3704 transitions. [2025-03-04 15:06:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:06:03,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 197 [2025-03-04 15:06:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:06:03,072 INFO L225 Difference]: With dead ends: 2620 [2025-03-04 15:06:03,072 INFO L226 Difference]: Without dead ends: 1402 [2025-03-04 15:06:03,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:06:03,073 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 10 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 15:06:03,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3455 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 15:06:03,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-04 15:06:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1392. [2025-03-04 15:06:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1348 states have (on average 1.403560830860534) internal successors, (1892), 1375 states have internal predecessors, (1892), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 15:06:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1960 transitions. [2025-03-04 15:06:03,087 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1960 transitions. Word has length 197 [2025-03-04 15:06:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:06:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1960 transitions. [2025-03-04 15:06:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:06:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1960 transitions. [2025-03-04 15:06:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 15:06:03,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:06:03,087 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:03,099 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-04 15:06:03,288 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,SelfDestructingSolverStorable25 [2025-03-04 15:06:03,288 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 15:06:03,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:06:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash -536074449, now seen corresponding path program 1 times [2025-03-04 15:06:03,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:06:03,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136268848] [2025-03-04 15:06:03,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:06:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:06:03,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 15:06:03,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 15:06:03,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:06:03,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:06:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:06:03,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:06:03,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136268848] [2025-03-04 15:06:03,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136268848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:06:03,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138167386] [2025-03-04 15:06:03,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:06:03,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:06:03,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:06:03,802 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-04 15:06:03,803 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-04 15:06:04,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 15:06:04,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 15:06:04,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:06:04,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:06:04,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 238 conjuncts are in the unsatisfiable core [2025-03-04 15:06:04,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:06:04,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:06:04,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04 15:06:04,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-04 15:06:04,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-04 15:06:04,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 15:06:04,953 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 15:06:04,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 15:06:04,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:06:04,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04 15:06:05,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 15:06:05,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:06:05,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 15:06:05,220 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 15:06:05,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-03-04 15:06:05,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 15:06:05,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2025-03-04 15:06:06,910 INFO L190 IndexEqualityManager]: detected not equals via solver