./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.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 f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:14:52,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:14:52,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:14:52,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:14:52,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:14:52,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:14:52,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:14:52,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:14:52,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:14:52,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:14:52,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:14:52,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:14:52,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:14:52,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:14:52,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:14:52,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:14:52,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:14:52,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:14:52,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:14:52,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:14:52,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:14:52,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:14:52,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:14:52,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:14:52,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:14:52,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:14:52,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:14:52,963 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 -> f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee [2025-03-09 06:14:53,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:14:53,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:14:53,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:14:53,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:14:53,173 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:14:53,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2025-03-09 06:14:54,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb68686d9/a3b4a05f48b34b2689996ad25b497d8d/FLAGc5c57ad56 [2025-03-09 06:14:54,623 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:14:54,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2025-03-09 06:14:54,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb68686d9/a3b4a05f48b34b2689996ad25b497d8d/FLAGc5c57ad56 [2025-03-09 06:14:54,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb68686d9/a3b4a05f48b34b2689996ad25b497d8d [2025-03-09 06:14:54,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:14:54,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:14:54,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:14:54,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:14:54,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:14:54,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:14:54" (1/1) ... [2025-03-09 06:14:54,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29aaaae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:54, skipping insertion in model container [2025-03-09 06:14:54,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:14:54" (1/1) ... [2025-03-09 06:14:54,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:14:55,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:14:55,363 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:14:55,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:14:55,486 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:14:55,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55 WrapperNode [2025-03-09 06:14:55,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:14:55,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:14:55,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:14:55,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:14:55,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,597 INFO L138 Inliner]: procedures = 176, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1855 [2025-03-09 06:14:55,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:14:55,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:14:55,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:14:55,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:14:55,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,724 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-03-09 06:14:55,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:14:55,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:14:55,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:14:55,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:14:55,794 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (1/1) ... [2025-03-09 06:14:55,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:14:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:14:55,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:14:55,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 06:14:55,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 06:14:55,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 06:14:55,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:14:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:14:55,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:14:56,038 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:14:56,040 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:14:57,562 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-03-09 06:14:57,562 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:14:57,637 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:14:57,637 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-09 06:14:57,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:14:57 BoogieIcfgContainer [2025-03-09 06:14:57,638 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:14:57,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:14:57,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:14:57,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:14:57,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:14:54" (1/3) ... [2025-03-09 06:14:57,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581a27d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:14:57, skipping insertion in model container [2025-03-09 06:14:57,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:14:55" (2/3) ... [2025-03-09 06:14:57,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581a27d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:14:57, skipping insertion in model container [2025-03-09 06:14:57,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:14:57" (3/3) ... [2025-03-09 06:14:57,644 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-3.i [2025-03-09 06:14:57,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:14:57,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test4-3.i that has 4 procedures, 492 locations, 1 initial locations, 43 loop locations, and 6 error locations. [2025-03-09 06:14:57,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:14:57,721 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;@2723b6bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:14:57,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:14:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 488 states, 463 states have (on average 1.6241900647948164) internal successors, (752), 479 states have internal predecessors, (752), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 06:14:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 06:14:57,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:14:57,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:14:57,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:14:57,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:14:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash 831463792, now seen corresponding path program 1 times [2025-03-09 06:14:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:14:57,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179574807] [2025-03-09 06:14:57,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:14:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:14:57,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:14:57,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:14:57,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:14:57,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:14:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:14:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:14:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179574807] [2025-03-09 06:14:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179574807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:14:57,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:14:57,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:14:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800273767] [2025-03-09 06:14:57,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:14:57,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:14:57,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:14:57,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:14:57,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:14:57,895 INFO L87 Difference]: Start difference. First operand has 488 states, 463 states have (on average 1.6241900647948164) internal successors, (752), 479 states have internal predecessors, (752), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-09 06:14:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:14:58,110 INFO L93 Difference]: Finished difference Result 1352 states and 2193 transitions. [2025-03-09 06:14:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:14:58,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-09 06:14:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:14:58,121 INFO L225 Difference]: With dead ends: 1352 [2025-03-09 06:14:58,121 INFO L226 Difference]: Without dead ends: 802 [2025-03-09 06:14:58,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:14:58,127 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 541 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:14:58,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1338 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:14:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-09 06:14:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 427. [2025-03-09 06:14:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.4579207920792079) internal successors, (589), 418 states have internal predecessors, (589), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 06:14:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 621 transitions. [2025-03-09 06:14:58,186 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 621 transitions. Word has length 5 [2025-03-09 06:14:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:14:58,187 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 621 transitions. [2025-03-09 06:14:58,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-09 06:14:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 621 transitions. [2025-03-09 06:14:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-09 06:14:58,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:14:58,192 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-09 06:14:58,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:14:58,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:14:58,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:14:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash -792384770, now seen corresponding path program 1 times [2025-03-09 06:14:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:14:58,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384603572] [2025-03-09 06:14:58,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:14:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:14:58,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-09 06:14:58,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-09 06:14:58,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:14:58,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:14:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:14:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:14:58,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384603572] [2025-03-09 06:14:58,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384603572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:14:58,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:14:58,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:14:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599925425] [2025-03-09 06:14:58,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:14:58,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:14:58,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:14:58,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:14:58,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:14:58,752 INFO L87 Difference]: Start difference. First operand 427 states and 621 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-09 06:14:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:14:58,907 INFO L93 Difference]: Finished difference Result 850 states and 1238 transitions. [2025-03-09 06:14:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:14:58,908 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-09 06:14:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:14:58,911 INFO L225 Difference]: With dead ends: 850 [2025-03-09 06:14:58,911 INFO L226 Difference]: Without dead ends: 430 [2025-03-09 06:14:58,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:14:58,915 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 105 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:14:58,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1551 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:14:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-09 06:14:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2025-03-09 06:14:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.4405940594059405) internal successors, (582), 418 states have internal predecessors, (582), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 06:14:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 614 transitions. [2025-03-09 06:14:58,959 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 614 transitions. Word has length 147 [2025-03-09 06:14:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:14:58,960 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 614 transitions. [2025-03-09 06:14:58,960 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-09 06:14:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 614 transitions. [2025-03-09 06:14:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-09 06:14:58,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:14:58,963 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-09 06:14:58,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:14:58,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:14:58,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:14:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1892840956, now seen corresponding path program 1 times [2025-03-09 06:14:58,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:14:58,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702260242] [2025-03-09 06:14:58,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:14:58,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:14:59,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-09 06:14:59,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-09 06:14:59,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:14:59,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:14:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:14:59,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:14:59,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702260242] [2025-03-09 06:14:59,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702260242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:14:59,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:14:59,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:14:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341797608] [2025-03-09 06:14:59,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:14:59,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:14:59,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:14:59,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:14:59,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:14:59,188 INFO L87 Difference]: Start difference. First operand 427 states and 614 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-09 06:14:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:14:59,326 INFO L93 Difference]: Finished difference Result 972 states and 1406 transitions. [2025-03-09 06:14:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:14:59,327 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-09 06:14:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:14:59,332 INFO L225 Difference]: With dead ends: 972 [2025-03-09 06:14:59,332 INFO L226 Difference]: Without dead ends: 552 [2025-03-09 06:14:59,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:14:59,333 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 134 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:14:59,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1121 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:14:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-09 06:14:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-09 06:14:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 529 states have (on average 1.448015122873346) internal successors, (766), 543 states have internal predecessors, (766), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 06:14:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 798 transitions. [2025-03-09 06:14:59,353 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 798 transitions. Word has length 147 [2025-03-09 06:14:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:14:59,355 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 798 transitions. [2025-03-09 06:14:59,355 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-09 06:14:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 798 transitions. [2025-03-09 06:14:59,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-09 06:14:59,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:14:59,357 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-09 06:14:59,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:14:59,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:14:59,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:14:59,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1471364511, now seen corresponding path program 1 times [2025-03-09 06:14:59,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:14:59,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901633085] [2025-03-09 06:14:59,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:14:59,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:14:59,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-09 06:14:59,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-09 06:14:59,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:14:59,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:14:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:14:59,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:14:59,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901633085] [2025-03-09 06:14:59,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901633085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:14:59,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:14:59,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:14:59,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717014195] [2025-03-09 06:14:59,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:14:59,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:14:59,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:14:59,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:14:59,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:14:59,677 INFO L87 Difference]: Start difference. First operand 552 states and 798 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-09 06:14:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:14:59,819 INFO L93 Difference]: Finished difference Result 975 states and 1408 transitions. [2025-03-09 06:14:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:14:59,820 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-09 06:14:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:14:59,822 INFO L225 Difference]: With dead ends: 975 [2025-03-09 06:14:59,822 INFO L226 Difference]: Without dead ends: 555 [2025-03-09 06:14:59,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:14:59,823 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 105 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:14:59,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1530 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:14:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-09 06:14:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2025-03-09 06:14:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 529 states have (on average 1.434782608695652) internal successors, (759), 543 states have internal predecessors, (759), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 06:14:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 791 transitions. [2025-03-09 06:14:59,841 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 791 transitions. Word has length 162 [2025-03-09 06:14:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:14:59,841 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 791 transitions. [2025-03-09 06:14:59,841 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-09 06:14:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 791 transitions. [2025-03-09 06:14:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-09 06:14:59,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:14:59,843 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-09 06:14:59,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:14:59,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:14:59,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:14:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1437659066, now seen corresponding path program 1 times [2025-03-09 06:14:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:14:59,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226128840] [2025-03-09 06:14:59,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:14:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:14:59,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-09 06:14:59,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-09 06:14:59,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:14:59,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:15:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226128840] [2025-03-09 06:15:00,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226128840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:00,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:15:00,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:15:00,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883947347] [2025-03-09 06:15:00,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:00,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:15:00,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:00,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:15:00,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:15:00,053 INFO L87 Difference]: Start difference. First operand 552 states and 791 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-09 06:15:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:00,157 INFO L93 Difference]: Finished difference Result 978 states and 1400 transitions. [2025-03-09 06:15:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:15:00,158 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-09 06:15:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:00,161 INFO L225 Difference]: With dead ends: 978 [2025-03-09 06:15:00,161 INFO L226 Difference]: Without dead ends: 558 [2025-03-09 06:15:00,164 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-09 06:15:00,164 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 1 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:00,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1082 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:15:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-09 06:15:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-03-09 06:15:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 535 states have (on average 1.4299065420560748) internal successors, (765), 549 states have internal predecessors, (765), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 06:15:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 797 transitions. [2025-03-09 06:15:00,187 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 797 transitions. Word has length 162 [2025-03-09 06:15:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:00,187 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 797 transitions. [2025-03-09 06:15:00,187 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-09 06:15:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 797 transitions. [2025-03-09 06:15:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-09 06:15:00,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:00,213 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-09 06:15:00,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:15:00,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 468078043, now seen corresponding path program 1 times [2025-03-09 06:15:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362727124] [2025-03-09 06:15:00,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:00,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-09 06:15:00,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-09 06:15:00,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:00,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:15:00,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362727124] [2025-03-09 06:15:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362727124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:00,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:15:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:15:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926682952] [2025-03-09 06:15:00,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:00,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:15:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:00,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:15:00,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:15:00,433 INFO L87 Difference]: Start difference. First operand 558 states and 797 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-09 06:15:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:00,597 INFO L93 Difference]: Finished difference Result 1175 states and 1674 transitions. [2025-03-09 06:15:00,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:15:00,598 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-09 06:15:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:00,602 INFO L225 Difference]: With dead ends: 1175 [2025-03-09 06:15:00,603 INFO L226 Difference]: Without dead ends: 749 [2025-03-09 06:15:00,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:15:00,606 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 318 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:00,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1106 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:15:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-09 06:15:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2025-03-09 06:15:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 723 states have (on average 1.4232365145228216) internal successors, (1029), 737 states have internal predecessors, (1029), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 06:15:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1067 transitions. [2025-03-09 06:15:00,629 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1067 transitions. Word has length 162 [2025-03-09 06:15:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1067 transitions. [2025-03-09 06:15:00,630 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-09 06:15:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1067 transitions. [2025-03-09 06:15:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-09 06:15:00,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:00,632 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-09 06:15:00,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:15:00,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:00,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 13995377, now seen corresponding path program 1 times [2025-03-09 06:15:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159600541] [2025-03-09 06:15:00,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:00,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-09 06:15:00,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-09 06:15:00,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:00,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:00,952 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-09 06:15:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:00,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159600541] [2025-03-09 06:15:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159600541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:00,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:15:00,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:15:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863343101] [2025-03-09 06:15:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:00,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:15:00,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:00,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:15:00,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:15:00,954 INFO L87 Difference]: Start difference. First operand 749 states and 1067 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-09 06:15:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:01,098 INFO L93 Difference]: Finished difference Result 814 states and 1152 transitions. [2025-03-09 06:15:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:15:01,099 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-09 06:15:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:01,102 INFO L225 Difference]: With dead ends: 814 [2025-03-09 06:15:01,102 INFO L226 Difference]: Without dead ends: 812 [2025-03-09 06:15:01,102 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-09 06:15:01,103 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 369 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:01,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1647 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:15:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-03-09 06:15:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2025-03-09 06:15:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 783 states have (on average 1.4125159642401022) internal successors, (1106), 797 states have internal predecessors, (1106), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 06:15:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1150 transitions. [2025-03-09 06:15:01,122 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1150 transitions. Word has length 177 [2025-03-09 06:15:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:01,122 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1150 transitions. [2025-03-09 06:15:01,122 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-09 06:15:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1150 transitions. [2025-03-09 06:15:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-09 06:15:01,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:01,124 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, 1, 1, 1, 1] [2025-03-09 06:15:01,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:15:01,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:01,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1472523758, now seen corresponding path program 1 times [2025-03-09 06:15:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:01,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103499705] [2025-03-09 06:15:01,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:01,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:01,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-09 06:15:01,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-09 06:15:01,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:01,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 06:15:01,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103499705] [2025-03-09 06:15:01,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103499705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:15:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212627884] [2025-03-09 06:15:01,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:01,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:01,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:15:01,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:15:01,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:15:01,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-09 06:15:01,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-09 06:15:01,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:01,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:01,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:15:01,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:15:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 06:15:02,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:15:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 06:15:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212627884] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:15:02,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:15:02,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 06:15:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618569750] [2025-03-09 06:15:02,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:15:02,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:15:02,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:02,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:15:02,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:15:02,309 INFO L87 Difference]: Start difference. First operand 812 states and 1150 transitions. Second operand has 10 states, 10 states have (on average 47.9) internal successors, (479), 10 states have internal predecessors, (479), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-09 06:15:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:02,588 INFO L93 Difference]: Finished difference Result 1233 states and 1754 transitions. [2025-03-09 06:15:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:15:02,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 47.9) internal successors, (479), 10 states have internal predecessors, (479), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 181 [2025-03-09 06:15:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:02,593 INFO L225 Difference]: With dead ends: 1233 [2025-03-09 06:15:02,593 INFO L226 Difference]: Without dead ends: 1201 [2025-03-09 06:15:02,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:15:02,594 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 2818 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2832 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:02,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2832 Valid, 2842 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:15:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-03-09 06:15:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2025-03-09 06:15:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1166 states have (on average 1.4108061749571184) internal successors, (1645), 1180 states have internal predecessors, (1645), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-09 06:15:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1701 transitions. [2025-03-09 06:15:02,620 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1701 transitions. Word has length 181 [2025-03-09 06:15:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:02,621 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1701 transitions. [2025-03-09 06:15:02,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 47.9) internal successors, (479), 10 states have internal predecessors, (479), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-09 06:15:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1701 transitions. [2025-03-09 06:15:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-09 06:15:02,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:02,622 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-09 06:15:02,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:15:02,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:02,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:02,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1611167485, now seen corresponding path program 1 times [2025-03-09 06:15:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222118295] [2025-03-09 06:15:02,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:02,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-09 06:15:03,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-09 06:15:03,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:03,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:03,596 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-09 06:15:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222118295] [2025-03-09 06:15:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222118295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:15:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834710204] [2025-03-09 06:15:03,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:03,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:03,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:15:03,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:15:03,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:15:03,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-09 06:15:04,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-09 06:15:04,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:04,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:04,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:15:04,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:15:04,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:15:04,097 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 21 treesize of output 20 [2025-03-09 06:15:04,742 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-09 06:15:04,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:15:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834710204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:04,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:15:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-09 06:15:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262254381] [2025-03-09 06:15:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:04,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:15:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:04,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:15:04,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:15:04,746 INFO L87 Difference]: Start difference. First operand 1201 states and 1701 transitions. Second operand has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 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-09 06:15:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:06,336 INFO L93 Difference]: Finished difference Result 2365 states and 3344 transitions. [2025-03-09 06:15:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 06:15:06,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 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-09 06:15:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:06,341 INFO L225 Difference]: With dead ends: 2365 [2025-03-09 06:15:06,341 INFO L226 Difference]: Without dead ends: 1249 [2025-03-09 06:15:06,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-09 06:15:06,343 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1018 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:06,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 3075 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 06:15:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-09 06:15:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1226. [2025-03-09 06:15:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1191 states have (on average 1.4063811922753988) internal successors, (1675), 1205 states have internal predecessors, (1675), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-09 06:15:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1731 transitions. [2025-03-09 06:15:06,378 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1731 transitions. Word has length 183 [2025-03-09 06:15:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:06,378 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1731 transitions. [2025-03-09 06:15:06,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 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-09 06:15:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1731 transitions. [2025-03-09 06:15:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-09 06:15:06,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:06,380 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-09 06:15:06,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:15:06,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-09 06:15:06,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:06,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:06,584 INFO L85 PathProgramCache]: Analyzing trace with hash 630313026, now seen corresponding path program 1 times [2025-03-09 06:15:06,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:06,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128745044] [2025-03-09 06:15:06,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:06,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:06,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-09 06:15:06,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 06:15:06,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:06,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:07,206 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-09 06:15:07,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:07,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128745044] [2025-03-09 06:15:07,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128745044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:15:07,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635806899] [2025-03-09 06:15:07,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:07,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:07,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:15:07,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:15:07,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:15:07,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-09 06:15:07,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 06:15:07,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:07,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:07,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:15:07,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:15:07,752 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-09 06:15:07,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:15:07,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635806899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:07,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:15:07,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:15:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888312912] [2025-03-09 06:15:07,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:07,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:15:07,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:07,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:15:07,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:15:07,754 INFO L87 Difference]: Start difference. First operand 1226 states and 1731 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-09 06:15:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:07,981 INFO L93 Difference]: Finished difference Result 2419 states and 3416 transitions. [2025-03-09 06:15:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:15:07,982 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-09 06:15:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:07,987 INFO L225 Difference]: With dead ends: 2419 [2025-03-09 06:15:07,988 INFO L226 Difference]: Without dead ends: 1303 [2025-03-09 06:15:07,989 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-09 06:15:07,990 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 17 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:07,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1484 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:15:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-09 06:15:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1279. [2025-03-09 06:15:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1244 states have (on average 1.3987138263665595) internal successors, (1740), 1258 states have internal predecessors, (1740), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-09 06:15:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1796 transitions. [2025-03-09 06:15:08,020 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1796 transitions. Word has length 184 [2025-03-09 06:15:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:08,020 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1796 transitions. [2025-03-09 06:15:08,020 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-09 06:15:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1796 transitions. [2025-03-09 06:15:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-09 06:15:08,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:08,023 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-09 06:15:08,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 06:15:08,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:08,224 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:08,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1636051200, now seen corresponding path program 1 times [2025-03-09 06:15:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:08,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209769944] [2025-03-09 06:15:08,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:08,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-09 06:15:08,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-09 06:15:08,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:08,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:08,624 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-09 06:15:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209769944] [2025-03-09 06:15:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209769944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:08,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:15:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:15:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413559315] [2025-03-09 06:15:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:08,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:15:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:08,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:15:08,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:15:08,625 INFO L87 Difference]: Start difference. First operand 1279 states and 1796 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-09 06:15:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:09,061 INFO L93 Difference]: Finished difference Result 2462 states and 3463 transitions. [2025-03-09 06:15:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:15:09,067 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-09 06:15:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:09,072 INFO L225 Difference]: With dead ends: 2462 [2025-03-09 06:15:09,072 INFO L226 Difference]: Without dead ends: 1297 [2025-03-09 06:15:09,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:15:09,075 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 8 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:09,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2273 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 06:15:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-03-09 06:15:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1291. [2025-03-09 06:15:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1256 states have (on average 1.3972929936305734) internal successors, (1755), 1270 states have internal predecessors, (1755), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-09 06:15:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1811 transitions. [2025-03-09 06:15:09,101 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1811 transitions. Word has length 185 [2025-03-09 06:15:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:09,101 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1811 transitions. [2025-03-09 06:15:09,101 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-09 06:15:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1811 transitions. [2025-03-09 06:15:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-09 06:15:09,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:09,103 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-09 06:15:09,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:15:09,103 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:09,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1955276098, now seen corresponding path program 1 times [2025-03-09 06:15:09,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:09,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160630629] [2025-03-09 06:15:09,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:09,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:09,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-09 06:15:09,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-09 06:15:09,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:09,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:09,442 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-09 06:15:09,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:09,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160630629] [2025-03-09 06:15:09,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160630629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:09,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:15:09,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:15:09,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571450601] [2025-03-09 06:15:09,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:09,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:15:09,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:09,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:15:09,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:15:09,444 INFO L87 Difference]: Start difference. First operand 1291 states and 1811 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-09 06:15:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:09,927 INFO L93 Difference]: Finished difference Result 2490 states and 3501 transitions. [2025-03-09 06:15:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:15:09,927 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-09 06:15:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:09,933 INFO L225 Difference]: With dead ends: 2490 [2025-03-09 06:15:09,934 INFO L226 Difference]: Without dead ends: 1324 [2025-03-09 06:15:09,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:15:09,936 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 12 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:09,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2699 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:15:09,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2025-03-09 06:15:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1315. [2025-03-09 06:15:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1280 states have (on average 1.396875) internal successors, (1788), 1294 states have internal predecessors, (1788), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-09 06:15:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1844 transitions. [2025-03-09 06:15:09,962 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1844 transitions. Word has length 186 [2025-03-09 06:15:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:09,962 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1844 transitions. [2025-03-09 06:15:09,962 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-09 06:15:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1844 transitions. [2025-03-09 06:15:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-09 06:15:09,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:09,964 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-09 06:15:09,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:15:09,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:09,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1347357958, now seen corresponding path program 1 times [2025-03-09 06:15:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522880284] [2025-03-09 06:15:09,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:10,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-09 06:15:10,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-09 06:15:10,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:10,356 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-09 06:15:10,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522880284] [2025-03-09 06:15:10,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522880284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:15:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584464549] [2025-03-09 06:15:10,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:10,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:10,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:15:10,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:15:10,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:15:10,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-09 06:15:10,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-09 06:15:10,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:10,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:10,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:15:10,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:15:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:15:10,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:15:10,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584464549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:10,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:15:10,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-09 06:15:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409727318] [2025-03-09 06:15:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:10,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:15:10,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:10,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:15:10,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:15:10,871 INFO L87 Difference]: Start difference. First operand 1315 states and 1844 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:15:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:10,968 INFO L93 Difference]: Finished difference Result 2460 states and 3467 transitions. [2025-03-09 06:15:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:15:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2025-03-09 06:15:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:10,973 INFO L225 Difference]: With dead ends: 2460 [2025-03-09 06:15:10,973 INFO L226 Difference]: Without dead ends: 1318 [2025-03-09 06:15:10,974 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-09 06:15:10,974 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:10,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1655 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:15:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-03-09 06:15:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2025-03-09 06:15:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1282 states have (on average 1.3970358814352575) internal successors, (1791), 1297 states have internal predecessors, (1791), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-09 06:15:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1853 transitions. [2025-03-09 06:15:10,998 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1853 transitions. Word has length 186 [2025-03-09 06:15:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:10,999 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1853 transitions. [2025-03-09 06:15:10,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:15:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1853 transitions. [2025-03-09 06:15:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-09 06:15:11,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:11,000 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-09 06:15:11,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:15:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:11,201 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:11,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash -211805810, now seen corresponding path program 1 times [2025-03-09 06:15:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172490948] [2025-03-09 06:15:11,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:11,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-09 06:15:11,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-09 06:15:11,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:11,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:11,884 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-09 06:15:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172490948] [2025-03-09 06:15:11,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172490948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:15:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64528413] [2025-03-09 06:15:11,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:11,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:11,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:15:11,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:15:11,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:15:12,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-09 06:15:12,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-09 06:15:12,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:12,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:12,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:15:12,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:15:12,634 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-09 06:15:12,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:15:12,685 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-09 06:15:12,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64528413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:15:12,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:15:12,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 06:15:12,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650547497] [2025-03-09 06:15:12,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:15:12,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:15:12,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:12,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:15:12,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:15:12,687 INFO L87 Difference]: Start difference. First operand 1318 states and 1853 transitions. Second operand has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 06:15:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:12,861 INFO L93 Difference]: Finished difference Result 2474 states and 3503 transitions. [2025-03-09 06:15:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:15:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 190 [2025-03-09 06:15:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:12,866 INFO L225 Difference]: With dead ends: 2474 [2025-03-09 06:15:12,867 INFO L226 Difference]: Without dead ends: 1329 [2025-03-09 06:15:12,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:15:12,869 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 6 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:12,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1656 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:15:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-03-09 06:15:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1327. [2025-03-09 06:15:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1290 states have (on average 1.3992248062015504) internal successors, (1805), 1305 states have internal predecessors, (1805), 28 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-09 06:15:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1867 transitions. [2025-03-09 06:15:12,904 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1867 transitions. Word has length 190 [2025-03-09 06:15:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:12,904 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1867 transitions. [2025-03-09 06:15:12,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 06:15:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1867 transitions. [2025-03-09 06:15:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-09 06:15:12,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:12,907 INFO L218 NwaCegarLoop]: trace histogram [12, 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-09 06:15:12,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 06:15:13,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 06:15:13,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:13,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash -643743674, now seen corresponding path program 2 times [2025-03-09 06:15:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:13,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341504443] [2025-03-09 06:15:13,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:15:13,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:13,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 198 statements into 2 equivalence classes. [2025-03-09 06:15:13,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 198 of 198 statements. [2025-03-09 06:15:13,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:15:13,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-09 06:15:14,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341504443] [2025-03-09 06:15:14,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341504443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:15:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186634499] [2025-03-09 06:15:14,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:15:14,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:14,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:15:14,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:15:14,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:15:14,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 198 statements into 2 equivalence classes. [2025-03-09 06:15:14,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 198 of 198 statements. [2025-03-09 06:15:14,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:15:14,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:14,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 06:15:14,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:15:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 84 proven. 25 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-09 06:15:14,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:15:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 22 proven. 31 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-09 06:15:14,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186634499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:15:14,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:15:14,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 19 [2025-03-09 06:15:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989270881] [2025-03-09 06:15:14,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:15:14,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:15:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:14,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:15:14,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:15:14,798 INFO L87 Difference]: Start difference. First operand 1327 states and 1867 transitions. Second operand has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 06:15:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:15,320 INFO L93 Difference]: Finished difference Result 2383 states and 3377 transitions. [2025-03-09 06:15:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 06:15:15,321 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 198 [2025-03-09 06:15:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:15,324 INFO L225 Difference]: With dead ends: 2383 [2025-03-09 06:15:15,325 INFO L226 Difference]: Without dead ends: 1099 [2025-03-09 06:15:15,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 06:15:15,327 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 41 mSDsluCounter, 5116 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5589 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:15,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5589 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 06:15:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-09 06:15:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2025-03-09 06:15:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1060 states have (on average 1.3820754716981132) internal successors, (1465), 1075 states have internal predecessors, (1465), 28 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-09 06:15:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1527 transitions. [2025-03-09 06:15:15,345 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1527 transitions. Word has length 198 [2025-03-09 06:15:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:15,346 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1527 transitions. [2025-03-09 06:15:15,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 06:15:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1527 transitions. [2025-03-09 06:15:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-09 06:15:15,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:15,347 INFO L218 NwaCegarLoop]: trace histogram [26, 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-09 06:15:15,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:15:15,548 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,SelfDestructingSolverStorable14 [2025-03-09 06:15:15,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1895902196, now seen corresponding path program 3 times [2025-03-09 06:15:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:15,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868048124] [2025-03-09 06:15:15,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:15:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:15,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 212 statements into 14 equivalence classes. [2025-03-09 06:15:15,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 95 of 212 statements. [2025-03-09 06:15:15,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:15:15,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2025-03-09 06:15:15,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:15,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868048124] [2025-03-09 06:15:15,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868048124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:15,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:15:15,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:15:15,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944839332] [2025-03-09 06:15:15,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:15,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:15:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:15,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:15:15,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:15:15,781 INFO L87 Difference]: Start difference. First operand 1097 states and 1527 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-09 06:15:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:16,161 INFO L93 Difference]: Finished difference Result 2155 states and 3012 transitions. [2025-03-09 06:15:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:15:16,163 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 212 [2025-03-09 06:15:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:16,167 INFO L225 Difference]: With dead ends: 2155 [2025-03-09 06:15:16,167 INFO L226 Difference]: Without dead ends: 1112 [2025-03-09 06:15:16,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:15:16,169 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 12 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:16,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2558 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 06:15:16,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-09 06:15:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1097. [2025-03-09 06:15:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1060 states have (on average 1.3820754716981132) internal successors, (1465), 1075 states have internal predecessors, (1465), 28 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-09 06:15:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1527 transitions. [2025-03-09 06:15:16,189 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1527 transitions. Word has length 212 [2025-03-09 06:15:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:16,189 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1527 transitions. [2025-03-09 06:15:16,189 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-09 06:15:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1527 transitions. [2025-03-09 06:15:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-09 06:15:16,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:16,190 INFO L218 NwaCegarLoop]: trace histogram [26, 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-09 06:15:16,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:15:16,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:16,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash -389184737, now seen corresponding path program 1 times [2025-03-09 06:15:16,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:16,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478123078] [2025-03-09 06:15:16,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:16,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:16,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-09 06:15:16,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 06:15:16,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:16,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2025-03-09 06:15:16,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:16,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478123078] [2025-03-09 06:15:16,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478123078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:15:16,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:15:16,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 06:15:16,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823764741] [2025-03-09 06:15:16,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:15:16,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:15:16,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:15:16,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:15:16,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:15:16,703 INFO L87 Difference]: Start difference. First operand 1097 states and 1527 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-09 06:15:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:15:17,127 INFO L93 Difference]: Finished difference Result 2165 states and 3022 transitions. [2025-03-09 06:15:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:15:17,128 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 213 [2025-03-09 06:15:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:15:17,132 INFO L225 Difference]: With dead ends: 2165 [2025-03-09 06:15:17,132 INFO L226 Difference]: Without dead ends: 1127 [2025-03-09 06:15:17,134 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-09 06:15:17,135 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 20 mSDsluCounter, 2974 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:15:17,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3447 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 06:15:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-03-09 06:15:17,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1118. [2025-03-09 06:15:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1081 states have (on average 1.3802035152636447) internal successors, (1492), 1096 states have internal predecessors, (1492), 28 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-09 06:15:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1554 transitions. [2025-03-09 06:15:17,155 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1554 transitions. Word has length 213 [2025-03-09 06:15:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:15:17,155 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1554 transitions. [2025-03-09 06:15:17,155 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-09 06:15:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1554 transitions. [2025-03-09 06:15:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-09 06:15:17,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:15:17,157 INFO L218 NwaCegarLoop]: trace histogram [26, 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-09 06:15:17,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:15:17,157 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:15:17,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:15:17,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2045649879, now seen corresponding path program 1 times [2025-03-09 06:15:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:15:17,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625897383] [2025-03-09 06:15:17,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:17,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:15:17,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-09 06:15:17,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 06:15:17,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:17,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-09 06:15:18,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:15:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625897383] [2025-03-09 06:15:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625897383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:15:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558602793] [2025-03-09 06:15:18,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:15:18,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:15:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:15:18,039 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:15:18,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:15:18,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-09 06:15:18,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 06:15:18,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:15:18,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:15:18,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 214 conjuncts are in the unsatisfiable core [2025-03-09 06:15:18,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:15:18,874 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-09 06:15:18,911 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-09 06:15:19,241 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-09 06:15:19,270 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-09 06:15:19,285 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-09 06:15:19,304 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-09 06:15:19,304 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-09 06:15:19,312 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-09 06:15:19,396 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-09 06:15:19,400 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-09 06:15:19,583 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 06:15:19,584 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 50 treesize of output 45 [2025-03-09 06:15:19,594 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