./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/McCarthy91_Iteration.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 7a5d554c80523420ffafe318e54a94b7662019572fad78d6e8fce2ccc83674b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:41:10,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:41:10,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:41:10,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:41:11,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:41:11,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:41:11,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:41:11,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:41:11,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:41:11,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:41:11,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:41:11,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:41:11,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:41:11,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:41:11,027 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:41:11,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:41:11,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:41:11,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:41:11,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:41:11,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:41:11,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:41:11,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:41:11,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:41:11,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:41:11,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:41:11,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:41:11,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:41:11,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:41:11,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:41:11,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:41:11,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:41:11,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:41:11,030 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a5d554c80523420ffafe318e54a94b7662019572fad78d6e8fce2ccc83674b0 [2025-03-09 01:41:11,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:41:11,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:41:11,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:41:11,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:41:11,276 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:41:11,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2025-03-09 01:41:12,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f3f24c0/b6bfcb206e6e4069b34e4c93917875b6/FLAG68a0b3ccb [2025-03-09 01:41:12,574 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:41:12,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2025-03-09 01:41:12,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f3f24c0/b6bfcb206e6e4069b34e4c93917875b6/FLAG68a0b3ccb [2025-03-09 01:41:12,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f3f24c0/b6bfcb206e6e4069b34e4c93917875b6 [2025-03-09 01:41:12,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:41:12,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:41:12,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:41:12,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:41:12,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:41:12,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541027ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12, skipping insertion in model container [2025-03-09 01:41:12,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:41:12,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:41:12,694 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:41:12,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:41:12,712 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:41:12,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12 WrapperNode [2025-03-09 01:41:12,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:41:12,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:41:12,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:41:12,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:41:12,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,728 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2025-03-09 01:41:12,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:41:12,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:41:12,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:41:12,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:41:12,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,736 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 01:41:12,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:41:12,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:41:12,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:41:12,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:41:12,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:41:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:12,762 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 01:41:12,765 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 01:41:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:41:12,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:41:12,826 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:41:12,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:41:12,915 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-09 01:41:12,916 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:41:12,923 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:41:12,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:41:12,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:41:12 BoogieIcfgContainer [2025-03-09 01:41:12,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:41:12,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:41:12,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:41:12,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:41:12,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:41:12" (1/3) ... [2025-03-09 01:41:12,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb8adbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:41:12, skipping insertion in model container [2025-03-09 01:41:12,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (2/3) ... [2025-03-09 01:41:12,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb8adbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:41:12, skipping insertion in model container [2025-03-09 01:41:12,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:41:12" (3/3) ... [2025-03-09 01:41:12,933 INFO L128 eAbstractionObserver]: Analyzing ICFG McCarthy91_Iteration.c [2025-03-09 01:41:12,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:41:12,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG McCarthy91_Iteration.c that has 1 procedures, 23 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-03-09 01:41:12,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:41:13,010 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;@37e3d22f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:41:13,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 01:41:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 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 01:41:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:41:13,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:41:13,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:13,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash 50546316, now seen corresponding path program 1 times [2025-03-09 01:41:13,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519356302] [2025-03-09 01:41:13,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:41:13,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:41:13,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,138 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 01:41:13,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519356302] [2025-03-09 01:41:13,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519356302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978147086] [2025-03-09 01:41:13,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,159 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 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) Second operand has 3 states, 2 states have (on average 2.5) 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 01:41:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,188 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-09 01:41:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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 01:41:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,193 INFO L225 Difference]: With dead ends: 23 [2025-03-09 01:41:13,193 INFO L226 Difference]: Without dead ends: 19 [2025-03-09 01:41:13,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,197 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-09 01:41:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-09 01:41:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-03-09 01:41:13,222 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 5 [2025-03-09 01:41:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,222 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-03-09 01:41:13,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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 01:41:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-03-09 01:41:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:41:13,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:41:13,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:41:13,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash 50546355, now seen corresponding path program 1 times [2025-03-09 01:41:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355547508] [2025-03-09 01:41:13,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:41:13,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:41:13,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,261 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 01:41:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355547508] [2025-03-09 01:41:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355547508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477329352] [2025-03-09 01:41:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,264 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.5) 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 01:41:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,296 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-03-09 01:41:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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 01:41:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,297 INFO L225 Difference]: With dead ends: 28 [2025-03-09 01:41:13,297 INFO L226 Difference]: Without dead ends: 27 [2025-03-09 01:41:13,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,298 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 22 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-09 01:41:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-09 01:41:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 24 states have internal predecessors, (30), 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 01:41:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-09 01:41:13,304 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 5 [2025-03-09 01:41:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,305 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-09 01:41:13,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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 01:41:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-09 01:41:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:41:13,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:41:13,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:13,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1566935773, now seen corresponding path program 1 times [2025-03-09 01:41:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651490275] [2025-03-09 01:41:13,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:41:13,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:41:13,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,341 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 01:41:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651490275] [2025-03-09 01:41:13,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651490275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780708598] [2025-03-09 01:41:13,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,343 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,364 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-09 01:41:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:41:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,366 INFO L225 Difference]: With dead ends: 25 [2025-03-09 01:41:13,366 INFO L226 Difference]: Without dead ends: 24 [2025-03-09 01:41:13,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,367 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-09 01:41:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-09 01:41:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 23 states have internal predecessors, (29), 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 01:41:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-09 01:41:13,373 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 6 [2025-03-09 01:41:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,374 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-09 01:41:13,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-03-09 01:41:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:41:13,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:41:13,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:13,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1566936990, now seen corresponding path program 1 times [2025-03-09 01:41:13,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727576883] [2025-03-09 01:41:13,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:41:13,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:41:13,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,409 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 01:41:13,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727576883] [2025-03-09 01:41:13,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727576883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736476623] [2025-03-09 01:41:13,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,415 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,432 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-09 01:41:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:41:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,433 INFO L225 Difference]: With dead ends: 24 [2025-03-09 01:41:13,433 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 01:41:13,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,434 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 01:41:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-09 01:41:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 22 states have internal predecessors, (27), 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 01:41:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-09 01:41:13,436 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 6 [2025-03-09 01:41:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,436 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-09 01:41:13,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-09 01:41:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:41:13,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:41:13,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:13,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1330368682, now seen corresponding path program 1 times [2025-03-09 01:41:13,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850914864] [2025-03-09 01:41:13,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:41:13,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:41:13,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,473 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 01:41:13,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850914864] [2025-03-09 01:41:13,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850914864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392703677] [2025-03-09 01:41:13,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,474 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 01:41:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,488 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-09 01:41:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-03-09 01:41:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,489 INFO L225 Difference]: With dead ends: 24 [2025-03-09 01:41:13,489 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 01:41:13,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,490 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 01:41:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-03-09 01:41:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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 01:41:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-09 01:41:13,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2025-03-09 01:41:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,493 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-09 01:41:13,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 01:41:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-09 01:41:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:41:13,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:41:13,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:13,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1708243845, now seen corresponding path program 1 times [2025-03-09 01:41:13,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930968033] [2025-03-09 01:41:13,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:41:13,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:41:13,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,513 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 01:41:13,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930968033] [2025-03-09 01:41:13,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930968033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941917200] [2025-03-09 01:41:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,515 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,532 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-09 01:41:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:41:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,533 INFO L225 Difference]: With dead ends: 40 [2025-03-09 01:41:13,533 INFO L226 Difference]: Without dead ends: 38 [2025-03-09 01:41:13,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,534 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-09 01:41:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-03-09 01:41:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 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 01:41:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-09 01:41:13,538 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2025-03-09 01:41:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,538 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-09 01:41:13,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-09 01:41:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:41:13,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,539 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:41:13,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:13,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash 775094937, now seen corresponding path program 1 times [2025-03-09 01:41:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251923166] [2025-03-09 01:41:13,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:41:13,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:41:13,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:13,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251923166] [2025-03-09 01:41:13,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251923166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:41:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407026423] [2025-03-09 01:41:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:41:13,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:41:13,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:41:13,582 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 01:41:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,612 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2025-03-09 01:41:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:41:13,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-09 01:41:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,612 INFO L225 Difference]: With dead ends: 55 [2025-03-09 01:41:13,612 INFO L226 Difference]: Without dead ends: 27 [2025-03-09 01:41:13,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:41:13,613 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-09 01:41:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-09 01:41:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 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 01:41:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-09 01:41:13,616 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 11 [2025-03-09 01:41:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,616 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-09 01:41:13,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 01:41:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-09 01:41:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:41:13,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,617 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:41:13,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:13,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash 26749846, now seen corresponding path program 1 times [2025-03-09 01:41:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510507057] [2025-03-09 01:41:13,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:41:13,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:41:13,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:13,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510507057] [2025-03-09 01:41:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510507057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524077032] [2025-03-09 01:41:13,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:13,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:13,674 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 01:41:13,676 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 01:41:13,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:41:13,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:41:13,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:41:13,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:13,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524077032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:13,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:13,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:41:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245835162] [2025-03-09 01:41:13,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:41:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:41:13,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:41:13,802 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 01:41:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,831 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-03-09 01:41:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:41:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 14 [2025-03-09 01:41:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,831 INFO L225 Difference]: With dead ends: 56 [2025-03-09 01:41:13,831 INFO L226 Difference]: Without dead ends: 54 [2025-03-09 01:41:13,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:41:13,832 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-09 01:41:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2025-03-09 01:41:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 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 01:41:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-09 01:41:13,837 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 14 [2025-03-09 01:41:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,837 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-09 01:41:13,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 01:41:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-09 01:41:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:41:13,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,839 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:41:14,040 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 01:41:14,040 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1959263842, now seen corresponding path program 1 times [2025-03-09 01:41:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459902448] [2025-03-09 01:41:14,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:14,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:41:14,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:41:14,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:14,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:41:14,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459902448] [2025-03-09 01:41:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459902448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:14,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:14,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:41:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88061847] [2025-03-09 01:41:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:14,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:41:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:14,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:41:14,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:41:14,086 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 01:41:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:14,107 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-03-09 01:41:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:41:14,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 17 [2025-03-09 01:41:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:14,110 INFO L225 Difference]: With dead ends: 62 [2025-03-09 01:41:14,110 INFO L226 Difference]: Without dead ends: 34 [2025-03-09 01:41:14,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:41:14,110 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:14,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 25 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-09 01:41:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-03-09 01:41:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 01:41:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-03-09 01:41:14,116 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2025-03-09 01:41:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:14,116 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-03-09 01:41:14,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 01:41:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-03-09 01:41:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 01:41:14,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:14,116 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-09 01:41:14,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:41:14,116 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:14,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:14,117 INFO L85 PathProgramCache]: Analyzing trace with hash -904729614, now seen corresponding path program 1 times [2025-03-09 01:41:14,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:14,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109970523] [2025-03-09 01:41:14,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:14,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:14,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:41:14,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:41:14,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:14,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109970523] [2025-03-09 01:41:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109970523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773867198] [2025-03-09 01:41:14,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:14,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:14,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:14,171 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 01:41:14,172 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 01:41:14,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:41:14,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:41:14,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:14,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:14,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:41:14,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:14,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:14,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773867198] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:14,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:41:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510632920] [2025-03-09 01:41:14,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:14,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:41:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:14,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:41:14,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:41:14,299 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 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 01:41:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:14,350 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2025-03-09 01:41:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:41:14,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 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 20 [2025-03-09 01:41:14,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:14,351 INFO L225 Difference]: With dead ends: 114 [2025-03-09 01:41:14,351 INFO L226 Difference]: Without dead ends: 57 [2025-03-09 01:41:14,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:41:14,353 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:14,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-09 01:41:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-09 01:41:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 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 01:41:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-09 01:41:14,361 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 20 [2025-03-09 01:41:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:14,361 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-09 01:41:14,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 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 01:41:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-09 01:41:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 01:41:14,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:14,362 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 1, 1, 1] [2025-03-09 01:41:14,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:41:14,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 01:41:14,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:14,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash -85441314, now seen corresponding path program 2 times [2025-03-09 01:41:14,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:14,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221011750] [2025-03-09 01:41:14,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:41:14,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:14,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:41:14,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:41:14,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:41:14,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:14,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:14,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221011750] [2025-03-09 01:41:14,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221011750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:14,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866657815] [2025-03-09 01:41:14,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:41:14,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:14,693 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 01:41:14,695 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 01:41:14,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:41:14,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:41:14,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:41:14,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:14,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:41:14,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:14,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:14,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866657815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:14,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:14,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-09 01:41:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485780347] [2025-03-09 01:41:14,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:14,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:41:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:14,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:41:14,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:41:14,906 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 16 states, 15 states have (on average 5.8) internal successors, (87), 16 states have internal predecessors, (87), 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 01:41:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:15,010 INFO L93 Difference]: Finished difference Result 258 states and 300 transitions. [2025-03-09 01:41:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:41:15,010 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.8) internal successors, (87), 16 states have internal predecessors, (87), 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 44 [2025-03-09 01:41:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:15,011 INFO L225 Difference]: With dead ends: 258 [2025-03-09 01:41:15,012 INFO L226 Difference]: Without dead ends: 105 [2025-03-09 01:41:15,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:41:15,013 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 96 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:15,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 136 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:41:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-09 01:41:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-09 01:41:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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 01:41:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2025-03-09 01:41:15,024 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 44 [2025-03-09 01:41:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:15,024 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2025-03-09 01:41:15,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.8) internal successors, (87), 16 states have internal predecessors, (87), 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 01:41:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2025-03-09 01:41:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 01:41:15,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:15,025 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 1, 1, 1] [2025-03-09 01:41:15,031 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 01:41:15,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:15,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:15,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:15,226 INFO L85 PathProgramCache]: Analyzing trace with hash -430183754, now seen corresponding path program 3 times [2025-03-09 01:41:15,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295354889] [2025-03-09 01:41:15,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:41:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:15,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 15 equivalence classes. [2025-03-09 01:41:15,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 01:41:15,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-09 01:41:15,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:15,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:15,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295354889] [2025-03-09 01:41:15,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295354889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:15,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319262444] [2025-03-09 01:41:15,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:41:15,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:15,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:15,548 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 01:41:15,549 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 01:41:15,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 15 equivalence classes. [2025-03-09 01:41:15,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 01:41:15,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-09 01:41:15,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:15,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:41:15,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:15,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319262444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:16,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-03-09 01:41:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489302428] [2025-03-09 01:41:16,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:16,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:41:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:16,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:41:16,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:41:16,051 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand has 32 states, 31 states have (on average 5.903225806451613) internal successors, (183), 32 states have internal predecessors, (183), 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 01:41:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:16,283 INFO L93 Difference]: Finished difference Result 546 states and 636 transitions. [2025-03-09 01:41:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 01:41:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.903225806451613) internal successors, (183), 32 states have internal predecessors, (183), 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 92 [2025-03-09 01:41:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:16,284 INFO L225 Difference]: With dead ends: 546 [2025-03-09 01:41:16,284 INFO L226 Difference]: Without dead ends: 201 [2025-03-09 01:41:16,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:41:16,285 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 212 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:16,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 310 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:41:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-09 01:41:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-09 01:41:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.02) internal successors, (204), 200 states have internal predecessors, (204), 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 01:41:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2025-03-09 01:41:16,302 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 92 [2025-03-09 01:41:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:16,302 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 204 transitions. [2025-03-09 01:41:16,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.903225806451613) internal successors, (183), 32 states have internal predecessors, (183), 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 01:41:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2025-03-09 01:41:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-09 01:41:16,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:16,304 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 1, 1, 1] [2025-03-09 01:41:16,312 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 01:41:16,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:16,504 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:16,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash -357104026, now seen corresponding path program 4 times [2025-03-09 01:41:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:16,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143285121] [2025-03-09 01:41:16,506 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:41:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:16,517 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 188 statements into 2 equivalence classes. [2025-03-09 01:41:16,545 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-09 01:41:16,548 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:41:16,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2790 backedges. 0 proven. 2790 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143285121] [2025-03-09 01:41:17,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143285121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059707000] [2025-03-09 01:41:17,393 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:41:17,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:17,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:17,395 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 01:41:17,397 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 01:41:17,422 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 188 statements into 2 equivalence classes. [2025-03-09 01:41:17,454 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-09 01:41:17,454 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:41:17,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:17,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 01:41:17,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2790 backedges. 0 proven. 2790 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:17,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2790 backedges. 0 proven. 2790 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:18,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059707000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:18,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:18,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2025-03-09 01:41:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700665740] [2025-03-09 01:41:18,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:18,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-09 01:41:18,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:18,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-09 01:41:18,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-09 01:41:18,858 INFO L87 Difference]: Start difference. First operand 201 states and 204 transitions. Second operand has 64 states, 63 states have (on average 5.9523809523809526) internal successors, (375), 64 states have internal predecessors, (375), 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 01:41:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:19,412 INFO L93 Difference]: Finished difference Result 1122 states and 1308 transitions. [2025-03-09 01:41:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-09 01:41:19,413 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 5.9523809523809526) internal successors, (375), 64 states have internal predecessors, (375), 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 188 [2025-03-09 01:41:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:19,414 INFO L225 Difference]: With dead ends: 1122 [2025-03-09 01:41:19,414 INFO L226 Difference]: Without dead ends: 393 [2025-03-09 01:41:19,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-09 01:41:19,417 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 552 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:19,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 657 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:41:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-09 01:41:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-09 01:41:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.010204081632653) internal successors, (396), 392 states have internal predecessors, (396), 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 01:41:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 396 transitions. [2025-03-09 01:41:19,436 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 396 transitions. Word has length 188 [2025-03-09 01:41:19,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:19,437 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 396 transitions. [2025-03-09 01:41:19,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 5.9523809523809526) internal successors, (375), 64 states have internal predecessors, (375), 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 01:41:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 396 transitions. [2025-03-09 01:41:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-09 01:41:19,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:19,441 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 63, 62, 1, 1, 1] [2025-03-09 01:41:19,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:41:19,645 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,SelfDestructingSolverStorable12 [2025-03-09 01:41:19,645 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:19,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1145274938, now seen corresponding path program 5 times [2025-03-09 01:41:19,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:19,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382393371] [2025-03-09 01:41:19,646 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:41:19,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:19,658 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 380 statements into 63 equivalence classes. [2025-03-09 01:41:19,742 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 380 of 380 statements. [2025-03-09 01:41:19,743 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-09 01:41:19,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 0 proven. 11718 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:22,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:22,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382393371] [2025-03-09 01:41:22,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382393371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:22,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618289391] [2025-03-09 01:41:22,231 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:41:22,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:22,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:22,233 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 01:41:22,234 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 01:41:22,262 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 380 statements into 63 equivalence classes. [2025-03-09 01:41:22,371 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 380 of 380 statements. [2025-03-09 01:41:22,371 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-09 01:41:22,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:22,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-09 01:41:22,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 0 proven. 11718 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:22,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 0 proven. 11718 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618289391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:26,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:26,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2025-03-09 01:41:26,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745719854] [2025-03-09 01:41:26,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:26,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-09 01:41:26,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:26,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-09 01:41:26,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2025-03-09 01:41:26,260 INFO L87 Difference]: Start difference. First operand 393 states and 396 transitions. Second operand has 128 states, 127 states have (on average 5.9763779527559056) internal successors, (759), 128 states have internal predecessors, (759), 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 01:41:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:28,246 INFO L93 Difference]: Finished difference Result 2274 states and 2652 transitions. [2025-03-09 01:41:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-09 01:41:28,246 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 127 states have (on average 5.9763779527559056) internal successors, (759), 128 states have internal predecessors, (759), 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 380 [2025-03-09 01:41:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:28,249 INFO L225 Difference]: With dead ends: 2274 [2025-03-09 01:41:28,249 INFO L226 Difference]: Without dead ends: 777 [2025-03-09 01:41:28,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2025-03-09 01:41:28,253 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1136 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:28,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1457 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:41:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-09 01:41:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2025-03-09 01:41:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 776 states have (on average 1.0051546391752577) internal successors, (780), 776 states have internal predecessors, (780), 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 01:41:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 780 transitions. [2025-03-09 01:41:28,269 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 780 transitions. Word has length 380 [2025-03-09 01:41:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:28,270 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 780 transitions. [2025-03-09 01:41:28,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 127 states have (on average 5.9763779527559056) internal successors, (759), 128 states have internal predecessors, (759), 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 01:41:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 780 transitions. [2025-03-09 01:41:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-03-09 01:41:28,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:28,280 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 127, 127, 126, 1, 1, 1] [2025-03-09 01:41:28,288 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 01:41:28,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:28,481 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:41:28,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash 319057030, now seen corresponding path program 6 times [2025-03-09 01:41:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:28,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982871492] [2025-03-09 01:41:28,482 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:41:28,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:28,497 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 764 statements into 127 equivalence classes. [2025-03-09 01:41:28,610 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) and asserted 764 of 764 statements. [2025-03-09 01:41:28,610 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2025-03-09 01:41:28,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 48006 backedges. 0 proven. 48006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:36,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:36,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982871492] [2025-03-09 01:41:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982871492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:36,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012811942] [2025-03-09 01:41:36,375 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:41:36,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:36,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:36,376 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 01:41:36,378 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 01:41:36,413 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 764 statements into 127 equivalence classes. [2025-03-09 01:41:36,624 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) and asserted 764 of 764 statements. [2025-03-09 01:41:36,624 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2025-03-09 01:41:36,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:36,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-09 01:41:36,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 48006 backedges. 0 proven. 48006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:37,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 48006 backedges. 0 proven. 48006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012811942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:49,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:49,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128, 128] total 255 [2025-03-09 01:41:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385868938] [2025-03-09 01:41:49,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:49,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 256 states [2025-03-09 01:41:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:49,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2025-03-09 01:41:49,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32640, Invalid=32640, Unknown=0, NotChecked=0, Total=65280 [2025-03-09 01:41:49,461 INFO L87 Difference]: Start difference. First operand 777 states and 780 transitions. Second operand has 256 states, 255 states have (on average 5.988235294117647) internal successors, (1527), 256 states have internal predecessors, (1527), 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 01:42:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:03,219 INFO L93 Difference]: Finished difference Result 4578 states and 5340 transitions. [2025-03-09 01:42:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2025-03-09 01:42:03,220 INFO L78 Accepts]: Start accepts. Automaton has has 256 states, 255 states have (on average 5.988235294117647) internal successors, (1527), 256 states have internal predecessors, (1527), 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 764 [2025-03-09 01:42:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:03,225 INFO L225 Difference]: With dead ends: 4578 [2025-03-09 01:42:03,225 INFO L226 Difference]: Without dead ends: 1545 [2025-03-09 01:42:03,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1654 GetRequests, 1400 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=32640, Invalid=32640, Unknown=0, NotChecked=0, Total=65280 [2025-03-09 01:42:03,230 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 3164 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 799 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3164 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:03,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3164 Valid, 3135 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 01:42:03,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-03-09 01:42:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2025-03-09 01:42:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.0025906735751295) internal successors, (1548), 1544 states have internal predecessors, (1548), 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 01:42:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1548 transitions. [2025-03-09 01:42:03,255 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1548 transitions. Word has length 764 [2025-03-09 01:42:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:03,256 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1548 transitions. [2025-03-09 01:42:03,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 256 states, 255 states have (on average 5.988235294117647) internal successors, (1527), 256 states have internal predecessors, (1527), 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 01:42:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1548 transitions. [2025-03-09 01:42:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2025-03-09 01:42:03,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:03,280 INFO L218 NwaCegarLoop]: trace histogram [255, 255, 255, 255, 255, 254, 1, 1, 1] [2025-03-09 01:42:03,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:42:03,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:42:03,481 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:03,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash 914901510, now seen corresponding path program 7 times [2025-03-09 01:42:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542461865] [2025-03-09 01:42:03,482 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:42:03,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:03,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1532 statements into 1 equivalence classes. [2025-03-09 01:42:03,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1532 of 1532 statements. [2025-03-09 01:42:03,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:03,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 194310 backedges. 0 proven. 194310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:39,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542461865] [2025-03-09 01:42:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542461865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:42:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595343626] [2025-03-09 01:42:39,705 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:42:39,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:42:39,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:42:39,707 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:42:39,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:42:39,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1532 statements into 1 equivalence classes. [2025-03-09 01:42:39,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1532 of 1532 statements. [2025-03-09 01:42:39,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:39,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:39,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 2555 conjuncts, 256 conjuncts are in the unsatisfiable core [2025-03-09 01:42:39,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:42:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 194310 backedges. 0 proven. 194310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:41,044 INFO L312 TraceCheckSpWp]: Computing backward predicates...