./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03c4946022d2e6f710dd6221d8af6a4ec932dc09e858917dba12290a0f27caf9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:31:12,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:31:12,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:31:12,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:31:12,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:31:12,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:31:12,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:31:12,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:31:12,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:31:12,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:31:12,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:31:12,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:31:12,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:31:12,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:31:12,416 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:31:12,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:31:12,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:31:12,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:31:12,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:31:12,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:31:12,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:31:12,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:31:12,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:31:12,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:31:12,417 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:31:12,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:31:12,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:31:12,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:31:12,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:31:12,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:31:12,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:31:12,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:31:12,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:31:12,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:31:12,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:31:12,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:31:12,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:31:12,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:31:12,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:31:12,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:31:12,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:31:12,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:31:12,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:31:12,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:31:12,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:31:12,419 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03c4946022d2e6f710dd6221d8af6a4ec932dc09e858917dba12290a0f27caf9 [2025-03-09 02:31:12,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:31:12,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:31:12,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:31:12,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:31:12,636 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:31:12,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_unwindbound5.c [2025-03-09 02:31:13,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b7b8c90/70153409137c4b5c85b33b215a8d75ee/FLAG65939677f [2025-03-09 02:31:13,926 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:31:13,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps2-ll_unwindbound5.c [2025-03-09 02:31:13,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b7b8c90/70153409137c4b5c85b33b215a8d75ee/FLAG65939677f [2025-03-09 02:31:14,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b7b8c90/70153409137c4b5c85b33b215a8d75ee [2025-03-09 02:31:14,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:31:14,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:31:14,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:31:14,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:31:14,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:31:14,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10913a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14, skipping insertion in model container [2025-03-09 02:31:14,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:31:14,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:31:14,429 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:31:14,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:31:14,448 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:31:14,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14 WrapperNode [2025-03-09 02:31:14,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:31:14,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:31:14,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:31:14,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:31:14,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,469 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-03-09 02:31:14,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:31:14,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:31:14,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:31:14,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:31:14,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,491 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:31:14,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:31:14,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:31:14,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:31:14,500 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:31:14,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (1/1) ... [2025-03-09 02:31:14,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:31:14,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:14,527 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 02:31:14,530 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 02:31:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:31:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:31:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:31:14,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:31:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:31:14,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:31:14,586 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:31:14,588 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:31:14,739 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-09 02:31:14,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:31:14,746 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:31:14,746 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:31:14,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:31:14 BoogieIcfgContainer [2025-03-09 02:31:14,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:31:14,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:31:14,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:31:14,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:31:14,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:31:14" (1/3) ... [2025-03-09 02:31:14,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537e55a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:31:14, skipping insertion in model container [2025-03-09 02:31:14,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:31:14" (2/3) ... [2025-03-09 02:31:14,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537e55a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:31:14, skipping insertion in model container [2025-03-09 02:31:14,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:31:14" (3/3) ... [2025-03-09 02:31:14,755 INFO L128 eAbstractionObserver]: Analyzing ICFG ps2-ll_unwindbound5.c [2025-03-09 02:31:14,766 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:31:14,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps2-ll_unwindbound5.c that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 24 error locations. [2025-03-09 02:31:14,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:31:14,813 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;@69966625, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:31:14,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 02:31:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 02:31:14,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:14,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 02:31:14,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2769503, now seen corresponding path program 1 times [2025-03-09 02:31:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:14,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267654322] [2025-03-09 02:31:14,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:14,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:14,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 02:31:14,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 02:31:14,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:14,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:14,970 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 02:31:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267654322] [2025-03-09 02:31:14,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267654322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:14,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:31:14,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:31:14,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615596639] [2025-03-09 02:31:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:14,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:31:14,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:14,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:31:14,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:31:14,993 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 02:31:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:15,056 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2025-03-09 02:31:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:31:15,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-09 02:31:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:15,062 INFO L225 Difference]: With dead ends: 129 [2025-03-09 02:31:15,062 INFO L226 Difference]: Without dead ends: 60 [2025-03-09 02:31:15,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:31:15,069 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:15,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:31:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-09 02:31:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-09 02:31:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 57 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2025-03-09 02:31:15,098 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 4 [2025-03-09 02:31:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:15,099 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2025-03-09 02:31:15,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 02:31:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2025-03-09 02:31:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:31:15,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:15,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:15,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:31:15,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:15,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2105622373, now seen corresponding path program 1 times [2025-03-09 02:31:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:15,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204803581] [2025-03-09 02:31:15,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:15,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:31:15,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:31:15,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:15,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:31:15,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514272887] [2025-03-09 02:31:15,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:15,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:15,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:15,119 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 02:31:15,121 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 02:31:15,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:31:15,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:31:15,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:15,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:15,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:31:15,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:15,185 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 02:31:15,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:31:15,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:15,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204803581] [2025-03-09 02:31:15,186 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:31:15,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514272887] [2025-03-09 02:31:15,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514272887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:15,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:31:15,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:31:15,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929157578] [2025-03-09 02:31:15,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:15,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:31:15,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:15,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:31:15,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:31:15,187 INFO L87 Difference]: Start difference. First operand 60 states and 61 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 02:31:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:15,258 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2025-03-09 02:31:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:31:15,258 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 02:31:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:15,259 INFO L225 Difference]: With dead ends: 92 [2025-03-09 02:31:15,259 INFO L226 Difference]: Without dead ends: 88 [2025-03-09 02:31:15,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 02:31:15,260 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:15,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:31:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-09 02:31:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2025-03-09 02:31:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 72 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-03-09 02:31:15,266 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 8 [2025-03-09 02:31:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:15,266 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-03-09 02:31:15,266 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 02:31:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-03-09 02:31:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:31:15,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:15,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:15,273 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 02:31:15,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:15,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:15,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash -849784108, now seen corresponding path program 1 times [2025-03-09 02:31:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321573585] [2025-03-09 02:31:15,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:15,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:31:15,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:31:15,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:15,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:15,509 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 02:31:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321573585] [2025-03-09 02:31:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321573585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:15,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:31:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:31:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292889467] [2025-03-09 02:31:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:31:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:15,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:31:15,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:31:15,510 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 02:31:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:15,581 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2025-03-09 02:31:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:31:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-03-09 02:31:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:15,582 INFO L225 Difference]: With dead ends: 94 [2025-03-09 02:31:15,582 INFO L226 Difference]: Without dead ends: 86 [2025-03-09 02:31:15,582 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 02:31:15,582 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:15,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:31:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-09 02:31:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2025-03-09 02:31:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-03-09 02:31:15,589 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 9 [2025-03-09 02:31:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:15,589 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-03-09 02:31:15,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 02:31:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-03-09 02:31:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 02:31:15,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:15,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:15,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:31:15,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:15,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1381105961, now seen corresponding path program 1 times [2025-03-09 02:31:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362006614] [2025-03-09 02:31:15,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:15,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 02:31:15,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 02:31:15,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:15,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:15,657 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 02:31:15,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:15,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362006614] [2025-03-09 02:31:15,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362006614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:15,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:31:15,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:31:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195260773] [2025-03-09 02:31:15,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:15,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:31:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:15,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:31:15,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:31:15,659 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:31:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:15,763 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-03-09 02:31:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:31:15,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-09 02:31:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:15,763 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:31:15,763 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 02:31:15,764 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 02:31:15,764 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:15,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 84 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:31:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 02:31:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-03-09 02:31:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.510204081632653) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2025-03-09 02:31:15,768 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 12 [2025-03-09 02:31:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:15,768 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2025-03-09 02:31:15,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:31:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2025-03-09 02:31:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 02:31:15,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:15,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:15,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:31:15,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash 92866451, now seen corresponding path program 1 times [2025-03-09 02:31:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:15,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208875495] [2025-03-09 02:31:15,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:15,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 02:31:15,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 02:31:15,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:15,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:15,822 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 02:31:15,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208875495] [2025-03-09 02:31:15,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208875495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:15,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:31:15,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:31:15,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658002346] [2025-03-09 02:31:15,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:15,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:31:15,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:15,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:31:15,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:31:15,824 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:15,838 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-03-09 02:31:15,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:31:15,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-09 02:31:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:15,839 INFO L225 Difference]: With dead ends: 76 [2025-03-09 02:31:15,839 INFO L226 Difference]: Without dead ends: 74 [2025-03-09 02:31:15,840 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 02:31:15,840 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:15,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:31:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-09 02:31:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-09 02:31:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.469387755102041) internal successors, (72), 70 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2025-03-09 02:31:15,845 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 21 [2025-03-09 02:31:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:15,845 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-03-09 02:31:15,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2025-03-09 02:31:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:31:15,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:15,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:15,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:31:15,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:15,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2084303473, now seen corresponding path program 1 times [2025-03-09 02:31:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:15,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162249656] [2025-03-09 02:31:15,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:15,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:31:15,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:31:15,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:15,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:15,942 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 02:31:15,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:15,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162249656] [2025-03-09 02:31:15,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162249656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:15,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:31:15,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:31:15,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168672323] [2025-03-09 02:31:15,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:15,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:31:15,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:15,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:31:15,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:31:15,943 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:16,014 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-09 02:31:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:31:16,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-09 02:31:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:16,015 INFO L225 Difference]: With dead ends: 77 [2025-03-09 02:31:16,015 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 02:31:16,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:31:16,016 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:16,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:31:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 02:31:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-09 02:31:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 71 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-03-09 02:31:16,021 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 25 [2025-03-09 02:31:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:16,021 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-03-09 02:31:16,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-03-09 02:31:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 02:31:16,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:16,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:16,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:31:16,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:16,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:16,022 INFO L85 PathProgramCache]: Analyzing trace with hash -188898233, now seen corresponding path program 1 times [2025-03-09 02:31:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001701259] [2025-03-09 02:31:16,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:16,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:31:16,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:31:16,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:16,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:16,100 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 02:31:16,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:16,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001701259] [2025-03-09 02:31:16,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001701259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:16,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:31:16,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:31:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297319282] [2025-03-09 02:31:16,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:16,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:31:16,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:16,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:31:16,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:31:16,102 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:16,149 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-03-09 02:31:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:31:16,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-09 02:31:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:16,150 INFO L225 Difference]: With dead ends: 77 [2025-03-09 02:31:16,150 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 02:31:16,150 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 02:31:16,150 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:16,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:31:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 02:31:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-09 02:31:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2025-03-09 02:31:16,159 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 26 [2025-03-09 02:31:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:16,159 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2025-03-09 02:31:16,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2025-03-09 02:31:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:31:16,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:16,160 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:16,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:31:16,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:16,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1142574619, now seen corresponding path program 1 times [2025-03-09 02:31:16,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:16,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447096280] [2025-03-09 02:31:16,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:16,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:31:16,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:31:16,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:16,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:16,245 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 02:31:16,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:16,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447096280] [2025-03-09 02:31:16,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447096280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:16,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315309417] [2025-03-09 02:31:16,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:16,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:16,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:16,247 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 02:31:16,249 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 02:31:16,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:31:16,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:31:16,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:16,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:16,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:31:16,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:16,364 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 02:31:16,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:31:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315309417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:31:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:31:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850765211] [2025-03-09 02:31:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:16,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:31:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:16,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:31:16,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:31:16,368 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:16,387 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-03-09 02:31:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:31:16,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-09 02:31:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:16,388 INFO L225 Difference]: With dead ends: 76 [2025-03-09 02:31:16,388 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 02:31:16,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:31:16,389 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:16,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 99 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:31:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 02:31:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-09 02:31:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 71 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-03-09 02:31:16,397 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 28 [2025-03-09 02:31:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:16,397 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-03-09 02:31:16,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-03-09 02:31:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:31:16,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:16,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:16,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:31:16,598 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,SelfDestructingSolverStorable7 [2025-03-09 02:31:16,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1060074798, now seen corresponding path program 1 times [2025-03-09 02:31:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839508601] [2025-03-09 02:31:16,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:16,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:31:16,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:31:16,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:16,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839508601] [2025-03-09 02:31:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839508601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327985909] [2025-03-09 02:31:16,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:16,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:16,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:16,685 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 02:31:16,686 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 02:31:16,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:31:16,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:31:16,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:16,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:16,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:31:16,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:16,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:31:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327985909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:31:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:31:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838821523] [2025-03-09 02:31:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:31:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:16,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:31:16,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:31:16,770 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:16,807 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2025-03-09 02:31:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:31:16,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-09 02:31:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:16,808 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:31:16,808 INFO L226 Difference]: Without dead ends: 89 [2025-03-09 02:31:16,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:31:16,809 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 33 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:16,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 201 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:31:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-09 02:31:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2025-03-09 02:31:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.411764705882353) internal successors, (72), 70 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2025-03-09 02:31:16,815 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 29 [2025-03-09 02:31:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:16,815 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-03-09 02:31:16,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2025-03-09 02:31:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:31:16,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:16,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:16,821 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 02:31:17,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:17,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:17,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash 206241057, now seen corresponding path program 1 times [2025-03-09 02:31:17,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:17,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691747859] [2025-03-09 02:31:17,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:17,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:31:17,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:31:17,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:17,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:31:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978924614] [2025-03-09 02:31:17,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:17,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:17,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:17,028 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 02:31:17,030 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 02:31:17,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:31:17,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:31:17,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:17,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:17,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:31:17,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:17,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:31:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691747859] [2025-03-09 02:31:17,175 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:31:17,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978924614] [2025-03-09 02:31:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978924614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:31:17,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:31:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 02:31:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091617357] [2025-03-09 02:31:17,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:31:17,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:31:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:17,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:31:17,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:31:17,175 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:17,311 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2025-03-09 02:31:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:31:17,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-03-09 02:31:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:17,312 INFO L225 Difference]: With dead ends: 152 [2025-03-09 02:31:17,312 INFO L226 Difference]: Without dead ends: 148 [2025-03-09 02:31:17,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:31:17,313 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 95 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:17,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 119 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:31:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-09 02:31:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 120. [2025-03-09 02:31:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 114 states have internal predecessors, (141), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:31:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2025-03-09 02:31:17,321 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 32 [2025-03-09 02:31:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:17,321 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2025-03-09 02:31:17,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2025-03-09 02:31:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:31:17,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:17,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:17,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:31:17,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:17,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:17,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2098505486, now seen corresponding path program 1 times [2025-03-09 02:31:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350143907] [2025-03-09 02:31:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:17,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:31:17,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:31:17,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:17,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:17,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:17,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350143907] [2025-03-09 02:31:17,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350143907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:17,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236850101] [2025-03-09 02:31:17,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:17,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:17,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:17,584 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 02:31:17,586 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 02:31:17,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:31:17,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:31:17,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:17,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:17,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:31:17,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:17,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:31:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:17,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236850101] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:31:17,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:31:17,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 02:31:17,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479681511] [2025-03-09 02:31:17,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:31:17,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:31:17,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:17,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:31:17,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:31:17,766 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:31:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:17,882 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2025-03-09 02:31:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:31:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-03-09 02:31:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:17,884 INFO L225 Difference]: With dead ends: 120 [2025-03-09 02:31:17,884 INFO L226 Difference]: Without dead ends: 117 [2025-03-09 02:31:17,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:31:17,884 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 74 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:17,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 100 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:31:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-09 02:31:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-09 02:31:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 111 states have internal predecessors, (134), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:31:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2025-03-09 02:31:17,890 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 33 [2025-03-09 02:31:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:17,891 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2025-03-09 02:31:17,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:31:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2025-03-09 02:31:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 02:31:17,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:17,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:17,899 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 02:31:18,093 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,SelfDestructingSolverStorable10 [2025-03-09 02:31:18,094 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:18,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash 629160639, now seen corresponding path program 1 times [2025-03-09 02:31:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:18,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102718848] [2025-03-09 02:31:18,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:18,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:31:18,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:31:18,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:18,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:18,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:18,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102718848] [2025-03-09 02:31:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102718848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:18,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366104750] [2025-03-09 02:31:18,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:18,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:18,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:18,138 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 02:31:18,139 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 02:31:18,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:31:18,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:31:18,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:18,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:18,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:31:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:18,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:31:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366104750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:31:18,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:31:18,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 02:31:18,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495170268] [2025-03-09 02:31:18,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:31:18,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:31:18,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:18,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:31:18,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:31:18,294 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 10 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:31:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:18,414 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2025-03-09 02:31:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:31:18,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 10 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2025-03-09 02:31:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:18,415 INFO L225 Difference]: With dead ends: 134 [2025-03-09 02:31:18,415 INFO L226 Difference]: Without dead ends: 127 [2025-03-09 02:31:18,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:31:18,416 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:18,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:31:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-09 02:31:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2025-03-09 02:31:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 111 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:31:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2025-03-09 02:31:18,423 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 34 [2025-03-09 02:31:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:18,423 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2025-03-09 02:31:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 10 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:31:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2025-03-09 02:31:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:31:18,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:18,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:18,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:31:18,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:18,628 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:18,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash -967014307, now seen corresponding path program 1 times [2025-03-09 02:31:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246996221] [2025-03-09 02:31:18,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:18,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:31:18,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:31:18,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:18,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:18,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:18,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246996221] [2025-03-09 02:31:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246996221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264457852] [2025-03-09 02:31:18,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:18,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:18,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:18,715 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 02:31:18,716 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 02:31:18,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:31:18,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:31:18,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:18,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:18,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:31:18,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:31:18,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:31:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264457852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:18,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:31:18,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 02:31:18,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011727565] [2025-03-09 02:31:18,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:18,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:31:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:18,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:31:18,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:31:18,865 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:18,923 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2025-03-09 02:31:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:31:18,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-09 02:31:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:18,924 INFO L225 Difference]: With dead ends: 119 [2025-03-09 02:31:18,924 INFO L226 Difference]: Without dead ends: 105 [2025-03-09 02:31:18,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:31:18,924 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:18,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 59 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:31:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-09 02:31:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-09 02:31:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.1397849462365592) internal successors, (106), 99 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:31:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2025-03-09 02:31:18,932 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 36 [2025-03-09 02:31:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:18,933 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2025-03-09 02:31:18,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:31:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2025-03-09 02:31:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:31:18,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:18,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:18,940 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 02:31:19,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:19,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:19,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash -57289523, now seen corresponding path program 1 times [2025-03-09 02:31:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:19,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001453325] [2025-03-09 02:31:19,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:19,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:31:19,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:31:19,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:19,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:31:19,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:19,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001453325] [2025-03-09 02:31:19,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001453325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:19,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780569928] [2025-03-09 02:31:19,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:19,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:19,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:19,170 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 02:31:19,172 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 02:31:19,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:31:19,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:31:19,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:19,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:19,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:31:19,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:31:19,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:31:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780569928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:19,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:31:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:31:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923256781] [2025-03-09 02:31:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:19,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:31:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:19,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:31:19,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:31:19,239 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:19,252 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2025-03-09 02:31:19,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:31:19,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-03-09 02:31:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:19,252 INFO L225 Difference]: With dead ends: 105 [2025-03-09 02:31:19,253 INFO L226 Difference]: Without dead ends: 104 [2025-03-09 02:31:19,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:31:19,253 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:19,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:31:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-09 02:31:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-09 02:31:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 1.10752688172043) internal successors, (103), 98 states have internal predecessors, (103), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:31:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2025-03-09 02:31:19,257 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 45 [2025-03-09 02:31:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:19,257 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2025-03-09 02:31:19,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2025-03-09 02:31:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:31:19,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:19,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:31:19,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:31:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 02:31:19,459 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:19,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1775975215, now seen corresponding path program 1 times [2025-03-09 02:31:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:19,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005925167] [2025-03-09 02:31:19,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:19,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:31:19,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:31:19,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:19,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:31:19,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:19,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005925167] [2025-03-09 02:31:19,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005925167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:19,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047920005] [2025-03-09 02:31:19,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:19,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:19,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:19,489 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:31:19,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:31:19,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:31:19,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:31:19,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:19,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:19,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:31:19,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:31:19,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:31:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:31:19,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047920005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:31:19,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:31:19,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:31:19,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887672984] [2025-03-09 02:31:19,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:31:19,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:31:19,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:19,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:31:19,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:31:19,612 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 7 states, 6 states have (on average 15.0) internal successors, (90), 7 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:31:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:19,636 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2025-03-09 02:31:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:31:19,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 7 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 46 [2025-03-09 02:31:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:19,636 INFO L225 Difference]: With dead ends: 120 [2025-03-09 02:31:19,637 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 02:31:19,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:31:19,637 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:19,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:31:19,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 02:31:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2025-03-09 02:31:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.088235294117647) internal successors, (111), 107 states have internal predecessors, (111), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:31:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2025-03-09 02:31:19,641 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 46 [2025-03-09 02:31:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:19,641 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2025-03-09 02:31:19,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 7 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:31:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2025-03-09 02:31:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-09 02:31:19,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:19,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-09 02:31:19,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 02:31:19,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 02:31:19,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:19,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:19,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1700577197, now seen corresponding path program 1 times [2025-03-09 02:31:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:19,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742744003] [2025-03-09 02:31:19,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:19,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:19,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 02:31:19,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 02:31:19,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:19,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:31:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:19,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742744003] [2025-03-09 02:31:19,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742744003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:19,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493971967] [2025-03-09 02:31:19,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:31:19,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:19,954 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:31:19,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:31:19,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 02:31:19,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 02:31:19,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:31:19,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:19,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:31:19,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:31:20,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:31:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:31:20,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493971967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:31:20,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:31:20,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-09 02:31:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285381212] [2025-03-09 02:31:20,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:31:20,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:31:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:20,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:31:20,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:31:20,325 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 20 states, 19 states have (on average 9.368421052631579) internal successors, (178), 20 states have internal predecessors, (178), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:31:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:20,562 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2025-03-09 02:31:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:31:20,562 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 9.368421052631579) internal successors, (178), 20 states have internal predecessors, (178), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2025-03-09 02:31:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:20,563 INFO L225 Difference]: With dead ends: 171 [2025-03-09 02:31:20,563 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 02:31:20,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:31:20,564 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:20,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 172 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:31:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 02:31:20,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2025-03-09 02:31:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.1111111111111112) internal successors, (160), 149 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:31:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2025-03-09 02:31:20,573 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 74 [2025-03-09 02:31:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:20,573 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2025-03-09 02:31:20,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 9.368421052631579) internal successors, (178), 20 states have internal predecessors, (178), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:31:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2025-03-09 02:31:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-09 02:31:20,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:20,574 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-09 02:31:20,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:31:20,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 02:31:20,775 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:20,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1119941941, now seen corresponding path program 2 times [2025-03-09 02:31:20,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:20,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083274656] [2025-03-09 02:31:20,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:31:20,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:20,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-09 02:31:20,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 02:31:20,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:31:20,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:31:20,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:20,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083274656] [2025-03-09 02:31:20,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083274656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:20,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275170663] [2025-03-09 02:31:20,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:31:20,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:20,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:20,918 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:31:20,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:31:20,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-09 02:31:20,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 02:31:20,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:31:20,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:20,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:31:20,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:31:21,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:31:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:31:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275170663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:31:21,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:31:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-09 02:31:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655423144] [2025-03-09 02:31:21,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:31:21,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 02:31:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:21,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 02:31:21,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:31:21,300 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 22 states have internal predecessors, (194), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:31:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:21,583 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2025-03-09 02:31:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 02:31:21,584 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 22 states have internal predecessors, (194), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 82 [2025-03-09 02:31:21,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:21,585 INFO L225 Difference]: With dead ends: 186 [2025-03-09 02:31:21,585 INFO L226 Difference]: Without dead ends: 174 [2025-03-09 02:31:21,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=321, Invalid=549, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:31:21,586 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:21,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 182 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:31:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-09 02:31:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 166. [2025-03-09 02:31:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.0921052631578947) internal successors, (166), 157 states have internal predecessors, (166), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:31:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2025-03-09 02:31:21,595 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 82 [2025-03-09 02:31:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:21,595 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2025-03-09 02:31:21,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 22 states have internal predecessors, (194), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:31:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2025-03-09 02:31:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 02:31:21,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:21,598 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-09 02:31:21,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:31:21,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:31:21,802 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:21,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1367443123, now seen corresponding path program 2 times [2025-03-09 02:31:21,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:21,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065748116] [2025-03-09 02:31:21,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:31:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:21,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-09 02:31:21,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 02:31:21,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:31:21,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:31:21,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409649735] [2025-03-09 02:31:21,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:31:21,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:21,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:21,829 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:31:21,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:31:21,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-09 02:31:21,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 02:31:21,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:31:21,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:21,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:31:21,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:31:21,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:31:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:31:22,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:22,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065748116] [2025-03-09 02:31:22,162 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:31:22,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409649735] [2025-03-09 02:31:22,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409649735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:31:22,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:31:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-09 02:31:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769764177] [2025-03-09 02:31:22,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:31:22,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:31:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:22,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:31:22,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:31:22,163 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 12 states, 11 states have (on average 15.454545454545455) internal successors, (170), 12 states have internal predecessors, (170), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:31:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:22,446 INFO L93 Difference]: Finished difference Result 249 states and 272 transitions. [2025-03-09 02:31:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:31:22,447 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 15.454545454545455) internal successors, (170), 12 states have internal predecessors, (170), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 104 [2025-03-09 02:31:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:22,448 INFO L225 Difference]: With dead ends: 249 [2025-03-09 02:31:22,448 INFO L226 Difference]: Without dead ends: 241 [2025-03-09 02:31:22,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:31:22,449 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 143 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:22,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 363 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:31:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-09 02:31:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 224. [2025-03-09 02:31:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 207 states have (on average 1.0917874396135265) internal successors, (226), 212 states have internal predecessors, (226), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:31:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 246 transitions. [2025-03-09 02:31:22,460 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 246 transitions. Word has length 104 [2025-03-09 02:31:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:22,460 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 246 transitions. [2025-03-09 02:31:22,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 15.454545454545455) internal successors, (170), 12 states have internal predecessors, (170), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:31:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 246 transitions. [2025-03-09 02:31:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 02:31:22,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:22,461 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-09 02:31:22,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:31:22,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 02:31:22,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:22,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 802825955, now seen corresponding path program 2 times [2025-03-09 02:31:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:22,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146200480] [2025-03-09 02:31:22,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:31:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:22,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-09 02:31:22,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 118 statements. [2025-03-09 02:31:22,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:31:22,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-09 02:31:22,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146200480] [2025-03-09 02:31:22,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146200480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249019779] [2025-03-09 02:31:22,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:31:22,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:22,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:22,691 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:31:22,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:31:22,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-09 02:31:22,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 118 statements. [2025-03-09 02:31:22,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:31:22,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:22,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:31:22,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-09 02:31:22,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:31:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-09 02:31:22,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249019779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:31:22,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:31:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 02:31:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202372329] [2025-03-09 02:31:22,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:31:22,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:31:22,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:22,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:31:22,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:31:22,926 INFO L87 Difference]: Start difference. First operand 224 states and 246 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:22,952 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2025-03-09 02:31:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:31:22,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2025-03-09 02:31:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:22,954 INFO L225 Difference]: With dead ends: 224 [2025-03-09 02:31:22,954 INFO L226 Difference]: Without dead ends: 223 [2025-03-09 02:31:22,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:31:22,955 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 67 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:22,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 67 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:31:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-09 02:31:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-09 02:31:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 207 states have (on average 1.0628019323671498) internal successors, (220), 211 states have internal predecessors, (220), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:31:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 240 transitions. [2025-03-09 02:31:22,964 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 240 transitions. Word has length 118 [2025-03-09 02:31:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:22,965 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 240 transitions. [2025-03-09 02:31:22,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 240 transitions. [2025-03-09 02:31:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-09 02:31:22,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:22,966 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1] [2025-03-09 02:31:22,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 02:31:23,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:23,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:23,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash -520085397, now seen corresponding path program 2 times [2025-03-09 02:31:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468153167] [2025-03-09 02:31:23,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:31:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:23,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-09 02:31:23,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-09 02:31:23,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:31:23,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:31:23,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468153167] [2025-03-09 02:31:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468153167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776642934] [2025-03-09 02:31:23,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:31:23,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:23,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:23,466 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:31:23,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 02:31:23,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-09 02:31:23,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 170 statements. [2025-03-09 02:31:23,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:31:23,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:23,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:31:23,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:31:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2025-03-09 02:31:23,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:31:23,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776642934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:31:23,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:31:23,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2025-03-09 02:31:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179283066] [2025-03-09 02:31:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:31:23,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:31:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:31:23,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:31:23,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:31:23,633 INFO L87 Difference]: Start difference. First operand 223 states and 240 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:31:23,694 INFO L93 Difference]: Finished difference Result 225 states and 242 transitions. [2025-03-09 02:31:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:31:23,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 170 [2025-03-09 02:31:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:31:23,696 INFO L225 Difference]: With dead ends: 225 [2025-03-09 02:31:23,696 INFO L226 Difference]: Without dead ends: 224 [2025-03-09 02:31:23,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:31:23,697 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:31:23,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 68 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:31:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-09 02:31:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2025-03-09 02:31:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 207 states have (on average 1.0434782608695652) internal successors, (216), 210 states have internal predecessors, (216), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:31:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 236 transitions. [2025-03-09 02:31:23,706 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 236 transitions. Word has length 170 [2025-03-09 02:31:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:31:23,706 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 236 transitions. [2025-03-09 02:31:23,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:31:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 236 transitions. [2025-03-09 02:31:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-09 02:31:23,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:31:23,707 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1] [2025-03-09 02:31:23,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 02:31:23,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:23,908 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:31:23,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:31:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1356442909, now seen corresponding path program 3 times [2025-03-09 02:31:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:31:23,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290654133] [2025-03-09 02:31:23,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:31:23,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:31:23,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 178 statements into 8 equivalence classes. [2025-03-09 02:31:23,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 178 of 178 statements. [2025-03-09 02:31:23,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 02:31:23,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:31:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:31:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290654133] [2025-03-09 02:31:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290654133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:31:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147277587] [2025-03-09 02:31:24,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:31:24,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:31:24,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:31:24,265 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:31:24,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 02:31:24,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 178 statements into 8 equivalence classes. [2025-03-09 02:31:24,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 178 statements. [2025-03-09 02:31:24,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 02:31:24,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:31:24,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:31:24,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:00,578 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (mod (+ |ULTIMATE.start_main_~y~0#1| .cse0) 2) 0) (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) .cse0) 2)))))) is different from true [2025-03-09 02:32:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2025-03-09 02:32:04,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:32:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147277587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:04,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:32:04,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2025-03-09 02:32:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085808544] [2025-03-09 02:32:04,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:04,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:32:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:04,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:32:04,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2025-03-09 02:32:04,606 INFO L87 Difference]: Start difference. First operand 222 states and 236 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:17,305 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 22 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-09 02:32:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:25,509 INFO L93 Difference]: Finished difference Result 224 states and 238 transitions. [2025-03-09 02:32:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:32:25,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 178 [2025-03-09 02:32:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:25,511 INFO L225 Difference]: With dead ends: 224 [2025-03-09 02:32:25,512 INFO L226 Difference]: Without dead ends: 218 [2025-03-09 02:32:25,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=116, Invalid=641, Unknown=3, NotChecked=52, Total=812 [2025-03-09 02:32:25,512 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:25,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 63 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 51 Unchecked, 0.5s Time] [2025-03-09 02:32:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-09 02:32:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2025-03-09 02:32:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 203 states have (on average 1.0098522167487685) internal successors, (205), 204 states have internal predecessors, (205), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:32:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 225 transitions. [2025-03-09 02:32:25,524 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 225 transitions. Word has length 178 [2025-03-09 02:32:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:25,525 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 225 transitions. [2025-03-09 02:32:25,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 225 transitions. [2025-03-09 02:32:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-09 02:32:25,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:25,526 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2025-03-09 02:32:25,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 02:32:25,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:25,731 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:32:25,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1637536727, now seen corresponding path program 3 times [2025-03-09 02:32:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:25,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636917661] [2025-03-09 02:32:25,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:32:25,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:25,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 248 statements into 11 equivalence classes. [2025-03-09 02:32:25,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 248 of 248 statements. [2025-03-09 02:32:25,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:32:25,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 896 proven. 64 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 02:32:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636917661] [2025-03-09 02:32:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636917661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143215293] [2025-03-09 02:32:26,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:32:26,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:26,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:26,709 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:32:26,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 02:32:26,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 248 statements into 11 equivalence classes. [2025-03-09 02:32:26,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 248 of 248 statements. [2025-03-09 02:32:26,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:32:26,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:26,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 02:32:26,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 1130 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:27,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:32:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 950 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 02:32:27,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143215293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:32:27,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:32:27,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23, 24] total 43 [2025-03-09 02:32:27,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518144136] [2025-03-09 02:32:27,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:32:27,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-09 02:32:27,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:27,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-09 02:32:27,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=1316, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 02:32:27,633 INFO L87 Difference]: Start difference. First operand 216 states and 225 transitions. Second operand has 43 states, 43 states have (on average 8.093023255813954) internal successors, (348), 43 states have internal predecessors, (348), 15 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 15 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-09 02:32:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:27,874 INFO L93 Difference]: Finished difference Result 236 states and 240 transitions. [2025-03-09 02:32:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 02:32:27,874 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 8.093023255813954) internal successors, (348), 43 states have internal predecessors, (348), 15 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 15 states have call predecessors, (25), 15 states have call successors, (25) Word has length 248 [2025-03-09 02:32:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:27,875 INFO L225 Difference]: With dead ends: 236 [2025-03-09 02:32:27,875 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:32:27,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 473 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=636, Invalid=1716, Unknown=0, NotChecked=0, Total=2352 [2025-03-09 02:32:27,876 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 18 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:27,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 814 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:32:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:32:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:32:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:32:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:32:27,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2025-03-09 02:32:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:27,877 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:32:27,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 8.093023255813954) internal successors, (348), 43 states have internal predecessors, (348), 15 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 15 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-09 02:32:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:32:27,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:32:27,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-03-09 02:32:27,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-03-09 02:32:27,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-03-09 02:32:27,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 02:32:28,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 02:32:28,088 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:32:28,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:32:44,373 WARN L286 SmtUtils]: Spent 16.24s on a formula simplification. DAG size of input: 75 DAG size of output: 66 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-09 02:32:44,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:32:44,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:32:44 BoogieIcfgContainer [2025-03-09 02:32:44,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:32:44,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:32:44,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:32:44,497 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:32:44,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:31:14" (3/4) ... [2025-03-09 02:32:44,499 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:32:44,503 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:32:44,508 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:32:44,508 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:32:44,508 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:32:44,509 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:32:44,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:32:44,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:32:44,564 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:32:44,565 INFO L158 Benchmark]: Toolchain (without parser) took 90266.51ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 108.0MB in the beginning and 246.9MB in the end (delta: -138.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2025-03-09 02:32:44,566 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:32:44,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.91ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 97.1MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:32:44,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.74ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.3MB in the end (delta: 745.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:32:44,568 INFO L158 Benchmark]: Boogie Preprocessor took 28.86ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 94.8MB in the end (delta: 750.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:32:44,568 INFO L158 Benchmark]: IcfgBuilder took 247.16ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 80.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:32:44,568 INFO L158 Benchmark]: TraceAbstraction took 89747.51ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 80.4MB in the beginning and 250.2MB in the end (delta: -169.8MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2025-03-09 02:32:44,568 INFO L158 Benchmark]: Witness Printer took 67.30ms. Allocated memory is still 293.6MB. Free memory was 250.2MB in the beginning and 246.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:32:44,569 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.91ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 97.1MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.74ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.3MB in the end (delta: 745.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.86ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 94.8MB in the end (delta: 750.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 247.16ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 80.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 89747.51ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 80.4MB in the beginning and 250.2MB in the end (delta: -169.8MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. * Witness Printer took 67.30ms. Allocated memory is still 293.6MB. Free memory was 250.2MB in the beginning and 246.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 71 edges, 24 error locations. Started 1 CEGAR loops. OverallTime: 73.3s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 915 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 905 mSDsluCounter, 3272 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 51 IncrementalHoareTripleChecker+Unchecked, 2384 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2291 IncrementalHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 888 mSDtfsCounter, 2291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2181 GetRequests, 1931 SyntacticMatches, 13 SemanticMatches, 237 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=18, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 121 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 45.7s InterpolantComputationTime, 2627 NumberOfCodeBlocks, 2147 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 3210 ConstructedInterpolants, 4 QuantifiedInterpolants, 12520 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1781 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 44 InterpolantComputations, 13 PerfectInterpolantSequences, 5386/7245 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((((((((((((y == 4) && (c <= 9223372036854775806)) && (1 <= c)) && (k <= 2147483647)) && (x <= 10)) && (counter <= 5)) && (4 <= counter)) && (4 <= x)) || ((((((c == 1) && (k <= 2147483647)) && (x == 1)) && (1 <= counter)) && (y == 1)) && (counter <= 5))) || ((((((((c <= 9223372036854775806) && (1 <= c)) && (k <= 2147483647)) && (3 == y)) && (counter <= 5)) && (x <= 6)) && (3 <= x)) && (3 <= counter))) || (((((((((c <= 9223372036854775806) && (counter == 5)) && (1 <= y)) && ((((y + ((__int128) y * y)) >= 0) ? ((y + ((__int128) y * y)) % 2) : (((y + ((__int128) y * y)) % 2) + 2)) == 0)) && (x <= (y + (((((__int128) -1 * y) + ((__int128) y * y)) >= 0) ? ((((__int128) -1 * y) + ((__int128) y * y)) / 2) : (((((__int128) -1 * y) + ((__int128) y * y)) / 2) - 1))))) && (1 <= c)) && (k <= 2147483647)) && (y <= x)) && ((((__int128) y * 8) + ((__int128) y * y)) <= 9223372036854775791))) || ((((((((2 <= x) && (2 <= counter)) && (1 <= c)) && (k <= 2147483647)) && (2 == y)) && (x <= 3)) && (counter <= 5)) && (c <= 9223372036854775805))) || (((((c == 0) && (k <= 2147483647)) && (y == 0)) && (counter == 0)) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:32:44,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE