./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound2.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/ps4-ll_unwindbound2.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 d0e99b579c23cc22a276a70c2363ed9ed20405eb8e4be0ab38c77cda92397cf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:34:01,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:34:01,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:34:01,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:34:01,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:34:01,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:34:01,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:34:01,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:34:01,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:34:01,184 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:34:01,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:34:01,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:34:01,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:34:01,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:34:01,186 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:34:01,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:34:01,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:34:01,186 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:34:01,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:34:01,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:34:01,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:34:01,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:34:01,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:34:01,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:34:01,187 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:34:01,187 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:34:01,187 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:34:01,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:34:01,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:34:01,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:34:01,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:34:01,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:34:01,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:34:01,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:34:01,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:34:01,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:34:01,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:34:01,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:34:01,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:34:01,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:34:01,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:34:01,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:34:01,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:34:01,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:34:01,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:34:01,190 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 -> d0e99b579c23cc22a276a70c2363ed9ed20405eb8e4be0ab38c77cda92397cf4 [2025-03-09 02:34:01,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:34:01,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:34:01,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:34:01,440 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:34:01,440 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:34:01,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound2.c [2025-03-09 02:34:02,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4654fea83/ae9b51aebbf64d30b5b58627f75bc4ad/FLAGe70b6dc0a [2025-03-09 02:34:02,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:34:02,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound2.c [2025-03-09 02:34:02,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4654fea83/ae9b51aebbf64d30b5b58627f75bc4ad/FLAGe70b6dc0a [2025-03-09 02:34:03,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4654fea83/ae9b51aebbf64d30b5b58627f75bc4ad [2025-03-09 02:34:03,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:34:03,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:34:03,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:34:03,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:34:03,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:34:03,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664321a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03, skipping insertion in model container [2025-03-09 02:34:03,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:34:03,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:34:03,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:34:03,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:34:03,294 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:34:03,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03 WrapperNode [2025-03-09 02:34:03,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:34:03,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:34:03,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:34:03,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:34:03,301 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:34:03" (1/1) ... [2025-03-09 02:34:03,311 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:34:03" (1/1) ... [2025-03-09 02:34:03,323 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 106 [2025-03-09 02:34:03,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:34:03,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:34:03,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:34:03,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:34:03,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,336 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:34:03,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:34:03,340 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:34:03,340 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:34:03,340 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:34:03,341 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (1/1) ... [2025-03-09 02:34:03,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:34:03,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:03,364 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:34:03,366 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:34:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:34:03,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:34:03,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:34:03,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:34:03,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:34:03,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:34:03,413 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:34:03,414 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:34:03,687 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-09 02:34:03,687 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:34:03,698 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:34:03,698 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:34:03,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:34:03 BoogieIcfgContainer [2025-03-09 02:34:03,699 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:34:03,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:34:03,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:34:03,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:34:03,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:34:03" (1/3) ... [2025-03-09 02:34:03,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22984aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:34:03, skipping insertion in model container [2025-03-09 02:34:03,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:03" (2/3) ... [2025-03-09 02:34:03,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22984aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:34:03, skipping insertion in model container [2025-03-09 02:34:03,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:34:03" (3/3) ... [2025-03-09 02:34:03,709 INFO L128 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound2.c [2025-03-09 02:34:03,718 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:34:03,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps4-ll_unwindbound2.c that has 2 procedures, 142 locations, 1 initial locations, 1 loop locations, and 62 error locations. [2025-03-09 02:34:03,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:34:03,770 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;@6e374da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:34:03,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-09 02:34:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 75 states have (on average 1.88) internal successors, (141), 137 states have internal predecessors, (141), 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:34:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 02:34:03,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:03,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 02:34:03,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:03,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash 5139871, now seen corresponding path program 1 times [2025-03-09 02:34:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100146502] [2025-03-09 02:34:03,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:03,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 02:34:03,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 02:34:03,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:03,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:03,927 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:34:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100146502] [2025-03-09 02:34:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100146502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796453166] [2025-03-09 02:34:03,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:03,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:03,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:03,947 INFO L87 Difference]: Start difference. First operand has 142 states, 75 states have (on average 1.88) internal successors, (141), 137 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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:34:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:04,009 INFO L93 Difference]: Finished difference Result 275 states and 302 transitions. [2025-03-09 02:34:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:34:04,011 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:34:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:04,015 INFO L225 Difference]: With dead ends: 275 [2025-03-09 02:34:04,015 INFO L226 Difference]: Without dead ends: 129 [2025-03-09 02:34:04,016 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:34:04,018 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 4 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 384 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:34:04,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 384 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-09 02:34:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-09 02:34:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 125 states have internal predecessors, (127), 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:34:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2025-03-09 02:34:04,044 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 4 [2025-03-09 02:34:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:04,044 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2025-03-09 02:34:04,044 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:34:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2025-03-09 02:34:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:34:04,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:04,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:04,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:34:04,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:04,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1496826461, now seen corresponding path program 1 times [2025-03-09 02:34:04,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:04,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693508517] [2025-03-09 02:34:04,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:04,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:34:04,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:34:04,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:04,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:04,090 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:34:04,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:04,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693508517] [2025-03-09 02:34:04,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693508517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:04,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:04,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:04,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458476745] [2025-03-09 02:34:04,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:04,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:34:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:04,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:34:04,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:34:04,092 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:34:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:04,192 INFO L93 Difference]: Finished difference Result 234 states and 246 transitions. [2025-03-09 02:34:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:34:04,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 02:34:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:04,194 INFO L225 Difference]: With dead ends: 234 [2025-03-09 02:34:04,194 INFO L226 Difference]: Without dead ends: 223 [2025-03-09 02:34:04,194 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:34:04,195 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 92 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:04,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 193 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-09 02:34:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 181. [2025-03-09 02:34:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 124 states have (on average 1.6774193548387097) internal successors, (208), 175 states have internal predecessors, (208), 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:34:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2025-03-09 02:34:04,208 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 7 [2025-03-09 02:34:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:04,208 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2025-03-09 02:34:04,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:34:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2025-03-09 02:34:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:34:04,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:04,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:04,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:34:04,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:04,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1606539303, now seen corresponding path program 1 times [2025-03-09 02:34:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:04,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792242164] [2025-03-09 02:34:04,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:04,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:04,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:34:04,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:34:04,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:04,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192329197] [2025-03-09 02:34:04,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:04,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:04,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:04,232 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:34:04,233 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:34:04,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:34:04,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:34:04,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:04,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:04,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:34:04,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:04,307 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:34:04,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:34:04,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:04,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792242164] [2025-03-09 02:34:04,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:04,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192329197] [2025-03-09 02:34:04,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192329197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:04,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:04,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:04,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179988508] [2025-03-09 02:34:04,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:04,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:34:04,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:04,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:34:04,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:34:04,310 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:34:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:04,475 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2025-03-09 02:34:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:34:04,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-03-09 02:34:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:04,477 INFO L225 Difference]: With dead ends: 214 [2025-03-09 02:34:04,477 INFO L226 Difference]: Without dead ends: 187 [2025-03-09 02:34:04,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:34:04,478 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:04,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 104 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:34:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-09 02:34:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-03-09 02:34:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.4765625) internal successors, (189), 179 states have internal predecessors, (189), 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:34:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-03-09 02:34:04,488 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 10 [2025-03-09 02:34:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:04,489 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-03-09 02:34:04,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:34:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-03-09 02:34:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:34:04,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:04,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:04,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:04,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:04,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:04,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash -624014949, now seen corresponding path program 1 times [2025-03-09 02:34:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:04,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312858509] [2025-03-09 02:34:04,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:04,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:04,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:34:04,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:34:04,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:04,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:04,764 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:34:04,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:04,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312858509] [2025-03-09 02:34:04,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312858509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:04,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:04,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:34:04,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427271603] [2025-03-09 02:34:04,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:04,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:04,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:04,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:04,766 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:34:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:04,898 INFO L93 Difference]: Finished difference Result 202 states and 208 transitions. [2025-03-09 02:34:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:34:04,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2025-03-09 02:34:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:04,899 INFO L225 Difference]: With dead ends: 202 [2025-03-09 02:34:04,899 INFO L226 Difference]: Without dead ends: 168 [2025-03-09 02:34:04,900 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:34:04,901 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 114 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:04,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 164 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-09 02:34:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2025-03-09 02:34:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 152 states have internal predecessors, (156), 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:34:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 162 transitions. [2025-03-09 02:34:04,909 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 162 transitions. Word has length 15 [2025-03-09 02:34:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:04,909 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 162 transitions. [2025-03-09 02:34:04,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:34:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 162 transitions. [2025-03-09 02:34:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 02:34:04,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:04,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:04,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:34:04,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:04,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:04,916 INFO L85 PathProgramCache]: Analyzing trace with hash 72446130, now seen corresponding path program 1 times [2025-03-09 02:34:04,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:04,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835541585] [2025-03-09 02:34:04,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:04,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:04,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:34:04,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:34:04,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:04,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:05,006 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:34:05,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:05,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835541585] [2025-03-09 02:34:05,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835541585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:05,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:05,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774730226] [2025-03-09 02:34:05,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:05,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:34:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:05,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:34:05,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:34:05,009 INFO L87 Difference]: Start difference. First operand 157 states and 162 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:34:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:05,023 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2025-03-09 02:34:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:34:05,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 35 [2025-03-09 02:34:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:05,024 INFO L225 Difference]: With dead ends: 159 [2025-03-09 02:34:05,025 INFO L226 Difference]: Without dead ends: 157 [2025-03-09 02:34:05,025 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:34:05,026 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 244 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:34:05,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 244 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-09 02:34:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-09 02:34:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5247524752475248) internal successors, (154), 152 states have internal predecessors, (154), 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:34:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2025-03-09 02:34:05,038 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 35 [2025-03-09 02:34:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:05,038 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2025-03-09 02:34:05,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:34:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2025-03-09 02:34:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:34:05,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:05,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:05,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:34:05,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:05,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1467914873, now seen corresponding path program 1 times [2025-03-09 02:34:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:05,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115252699] [2025-03-09 02:34:05,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:05,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:34:05,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:34:05,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:05,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [762257064] [2025-03-09 02:34:05,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:05,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:05,059 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:34:05,061 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:34:05,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:34:05,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:34:05,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:05,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:05,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:34:05,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:05,153 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:34:05,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:34:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115252699] [2025-03-09 02:34:05,155 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762257064] [2025-03-09 02:34:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762257064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:34:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63211223] [2025-03-09 02:34:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:05,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:05,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:05,156 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:34:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:05,401 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2025-03-09 02:34:05,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:34:05,401 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), 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 40 [2025-03-09 02:34:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:05,403 INFO L225 Difference]: With dead ends: 258 [2025-03-09 02:34:05,403 INFO L226 Difference]: Without dead ends: 232 [2025-03-09 02:34:05,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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:34:05,403 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 72 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:05,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 124 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:34:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-09 02:34:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2025-03-09 02:34:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.4817073170731707) internal successors, (243), 215 states have internal predecessors, (243), 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:34:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 253 transitions. [2025-03-09 02:34:05,410 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 253 transitions. Word has length 40 [2025-03-09 02:34:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:05,411 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 253 transitions. [2025-03-09 02:34:05,411 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), 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:34:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 253 transitions. [2025-03-09 02:34:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 02:34:05,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:05,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:05,419 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:34:05,615 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,SelfDestructingSolverStorable5 [2025-03-09 02:34:05,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:05,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash -704989654, now seen corresponding path program 1 times [2025-03-09 02:34:05,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:05,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502554686] [2025-03-09 02:34:05,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:05,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 02:34:05,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 02:34:05,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:05,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:05,736 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:34:05,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:05,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502554686] [2025-03-09 02:34:05,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502554686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:05,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:05,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:34:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28680799] [2025-03-09 02:34:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:05,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:05,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:05,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:05,738 INFO L87 Difference]: Start difference. First operand 222 states and 253 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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:34:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:05,970 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2025-03-09 02:34:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:34:05,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 43 [2025-03-09 02:34:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:05,971 INFO L225 Difference]: With dead ends: 223 [2025-03-09 02:34:05,971 INFO L226 Difference]: Without dead ends: 222 [2025-03-09 02:34:05,972 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:34:05,972 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 33 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:05,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 208 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:34:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-09 02:34:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-09 02:34:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.475609756097561) internal successors, (242), 215 states have internal predecessors, (242), 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:34:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 252 transitions. [2025-03-09 02:34:05,984 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 252 transitions. Word has length 43 [2025-03-09 02:34:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:05,985 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 252 transitions. [2025-03-09 02:34:05,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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:34:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 252 transitions. [2025-03-09 02:34:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:34:05,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:05,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:05,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:34:05,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:05,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash -379842763, now seen corresponding path program 1 times [2025-03-09 02:34:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:05,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467175562] [2025-03-09 02:34:05,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:05,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:05,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:34:05,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:34:05,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:05,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:06,054 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:34:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:06,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467175562] [2025-03-09 02:34:06,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467175562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:06,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:06,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:34:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659905060] [2025-03-09 02:34:06,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:06,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:06,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:06,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:06,057 INFO L87 Difference]: Start difference. First operand 222 states and 252 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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:34:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:06,117 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2025-03-09 02:34:06,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:34:06,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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 44 [2025-03-09 02:34:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:06,119 INFO L225 Difference]: With dead ends: 223 [2025-03-09 02:34:06,119 INFO L226 Difference]: Without dead ends: 222 [2025-03-09 02:34:06,119 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:34:06,120 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 30 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:06,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 192 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-09 02:34:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-09 02:34:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 215 states have internal predecessors, (241), 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:34:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 251 transitions. [2025-03-09 02:34:06,127 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 251 transitions. Word has length 44 [2025-03-09 02:34:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:06,127 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 251 transitions. [2025-03-09 02:34:06,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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:34:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 251 transitions. [2025-03-09 02:34:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:34:06,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:06,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:06,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:34:06,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:06,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash 43328243, now seen corresponding path program 1 times [2025-03-09 02:34:06,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:06,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598188541] [2025-03-09 02:34:06,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:06,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:34:06,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:34:06,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:06,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:06,206 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:34:06,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:06,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598188541] [2025-03-09 02:34:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598188541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:06,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195486206] [2025-03-09 02:34:06,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:06,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:06,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:06,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:34:06,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:34:06,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:34:06,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:34:06,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:06,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:06,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:34:06,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:06,332 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:34:06,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:34:06,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195486206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:06,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:34:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505421999] [2025-03-09 02:34:06,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:06,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:34:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:06,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:34:06,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:06,333 INFO L87 Difference]: Start difference. First operand 222 states and 251 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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:34:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:06,351 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2025-03-09 02:34:06,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:34:06,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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 46 [2025-03-09 02:34:06,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:06,352 INFO L225 Difference]: With dead ends: 222 [2025-03-09 02:34:06,352 INFO L226 Difference]: Without dead ends: 221 [2025-03-09 02:34:06,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 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:34:06,353 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 88 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 239 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:34:06,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 239 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-09 02:34:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-03-09 02:34:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.4573170731707317) internal successors, (239), 214 states have internal predecessors, (239), 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:34:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 249 transitions. [2025-03-09 02:34:06,360 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 249 transitions. Word has length 46 [2025-03-09 02:34:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 249 transitions. [2025-03-09 02:34:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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:34:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 249 transitions. [2025-03-09 02:34:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 02:34:06,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:06,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:06,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:06,566 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:34:06,566 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:06,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:06,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1343175633, now seen corresponding path program 1 times [2025-03-09 02:34:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:06,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681569356] [2025-03-09 02:34:06,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:06,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:06,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:34:06,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:34:06,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:06,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:06,630 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:34:06,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681569356] [2025-03-09 02:34:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681569356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70189919] [2025-03-09 02:34:06,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:06,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:06,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:06,633 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:34:06,634 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:34:06,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:34:06,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:34:06,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:06,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:06,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:34:06,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:06,719 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:34:06,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:34:06,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70189919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:06,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:06,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:34:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741397679] [2025-03-09 02:34:06,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:06,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:34:06,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:06,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:34:06,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:06,721 INFO L87 Difference]: Start difference. First operand 221 states and 249 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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:34:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:06,762 INFO L93 Difference]: Finished difference Result 304 states and 342 transitions. [2025-03-09 02:34:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:34:06,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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 47 [2025-03-09 02:34:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:06,763 INFO L225 Difference]: With dead ends: 304 [2025-03-09 02:34:06,763 INFO L226 Difference]: Without dead ends: 303 [2025-03-09 02:34:06,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 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:34:06,764 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 85 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:06,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 564 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-09 02:34:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 238. [2025-03-09 02:34:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 179 states have (on average 1.458100558659218) internal successors, (261), 230 states have internal predecessors, (261), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:34:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 275 transitions. [2025-03-09 02:34:06,770 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 275 transitions. Word has length 47 [2025-03-09 02:34:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:06,771 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 275 transitions. [2025-03-09 02:34:06,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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:34:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 275 transitions. [2025-03-09 02:34:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:34:06,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:06,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:06,779 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:34:06,973 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:34:06,973 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:06,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1993369649, now seen corresponding path program 1 times [2025-03-09 02:34:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797131408] [2025-03-09 02:34:06,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:06,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:34:06,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:34:06,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:06,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:06,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926414296] [2025-03-09 02:34:06,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:06,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:06,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:06,985 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:34:06,986 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:34:07,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:34:07,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:34:07,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:07,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:07,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:34:07,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:07,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:07,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:07,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797131408] [2025-03-09 02:34:07,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:07,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926414296] [2025-03-09 02:34:07,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926414296] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:07,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-09 02:34:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943224197] [2025-03-09 02:34:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:07,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:34:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:07,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:34:07,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:34:07,311 INFO L87 Difference]: Start difference. First operand 238 states and 275 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 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:34:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:07,840 INFO L93 Difference]: Finished difference Result 280 states and 340 transitions. [2025-03-09 02:34:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:34:07,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 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 49 [2025-03-09 02:34:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:07,842 INFO L225 Difference]: With dead ends: 280 [2025-03-09 02:34:07,842 INFO L226 Difference]: Without dead ends: 277 [2025-03-09 02:34:07,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:34:07,843 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:07,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 136 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:34:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-09 02:34:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 235. [2025-03-09 02:34:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 179 states have (on average 1.4301675977653632) internal successors, (256), 227 states have internal predecessors, (256), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:34:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 270 transitions. [2025-03-09 02:34:07,854 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 270 transitions. Word has length 49 [2025-03-09 02:34:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:07,854 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 270 transitions. [2025-03-09 02:34:07,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 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:34:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 270 transitions. [2025-03-09 02:34:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:34:07,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:07,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:07,862 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:34:08,058 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:34:08,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:08,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1993369685, now seen corresponding path program 1 times [2025-03-09 02:34:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828253529] [2025-03-09 02:34:08,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:08,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:34:08,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:34:08,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:08,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:08,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828253529] [2025-03-09 02:34:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828253529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578619392] [2025-03-09 02:34:08,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:08,132 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:34:08,133 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:34:08,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:34:08,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:34:08,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:08,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:08,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:34:08,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:08,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:08,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578619392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:08,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:34:08,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2025-03-09 02:34:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245163128] [2025-03-09 02:34:08,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:08,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:34:08,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:08,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:34:08,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:34:08,289 INFO L87 Difference]: Start difference. First operand 235 states and 270 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:34:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:08,319 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2025-03-09 02:34:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:34:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2025-03-09 02:34:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:08,321 INFO L225 Difference]: With dead ends: 276 [2025-03-09 02:34:08,321 INFO L226 Difference]: Without dead ends: 232 [2025-03-09 02:34:08,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:34:08,322 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 9 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:08,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 503 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-09 02:34:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-09 02:34:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 176 states have (on average 1.4090909090909092) internal successors, (248), 223 states have internal predecessors, (248), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:34:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 260 transitions. [2025-03-09 02:34:08,328 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 260 transitions. Word has length 49 [2025-03-09 02:34:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:08,328 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 260 transitions. [2025-03-09 02:34:08,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:34:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 260 transitions. [2025-03-09 02:34:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:34:08,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:08,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:08,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:08,529 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:34:08,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:08,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1664916881, now seen corresponding path program 1 times [2025-03-09 02:34:08,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298157662] [2025-03-09 02:34:08,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:08,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:34:08,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:34:08,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:08,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:08,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026919135] [2025-03-09 02:34:08,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:08,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:08,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:08,541 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:34:08,542 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:34:08,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:34:08,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:34:08,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:08,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:08,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:34:08,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:08,667 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:34:08,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:08,752 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:34:08,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298157662] [2025-03-09 02:34:08,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:08,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026919135] [2025-03-09 02:34:08,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026919135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:08,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:34:08,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 02:34:08,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251923398] [2025-03-09 02:34:08,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:08,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:34:08,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:08,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:34:08,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:08,753 INFO L87 Difference]: Start difference. First operand 232 states and 260 transitions. Second operand has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 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:34:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:09,136 INFO L93 Difference]: Finished difference Result 272 states and 297 transitions. [2025-03-09 02:34:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:34:09,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 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 50 [2025-03-09 02:34:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:09,137 INFO L225 Difference]: With dead ends: 272 [2025-03-09 02:34:09,137 INFO L226 Difference]: Without dead ends: 260 [2025-03-09 02:34:09,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:09,138 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 235 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:09,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 218 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:34:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-09 02:34:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 246. [2025-03-09 02:34:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 195 states have (on average 1.3435897435897435) internal successors, (262), 236 states have internal predecessors, (262), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:34:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 276 transitions. [2025-03-09 02:34:09,146 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 276 transitions. Word has length 50 [2025-03-09 02:34:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:09,147 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 276 transitions. [2025-03-09 02:34:09,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 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:34:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 276 transitions. [2025-03-09 02:34:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:34:09,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:09,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:09,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:09,348 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:34:09,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:09,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash -251742265, now seen corresponding path program 1 times [2025-03-09 02:34:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:09,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326904313] [2025-03-09 02:34:09,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:09,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:34:09,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:34:09,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:09,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:09,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764594089] [2025-03-09 02:34:09,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:09,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:09,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:09,362 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:34:09,363 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:34:09,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:34:09,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:34:09,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:09,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:09,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:34:09,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:09,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:34:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326904313] [2025-03-09 02:34:09,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:09,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764594089] [2025-03-09 02:34:09,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764594089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:09,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:34:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994011875] [2025-03-09 02:34:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:09,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:34:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:09,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:34:09,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:34:09,525 INFO L87 Difference]: Start difference. First operand 246 states and 276 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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:34:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:09,678 INFO L93 Difference]: Finished difference Result 258 states and 288 transitions. [2025-03-09 02:34:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:34:09,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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 57 [2025-03-09 02:34:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:09,679 INFO L225 Difference]: With dead ends: 258 [2025-03-09 02:34:09,680 INFO L226 Difference]: Without dead ends: 188 [2025-03-09 02:34:09,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:34:09,680 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 150 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:09,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 49 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-09 02:34:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2025-03-09 02:34:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 156 states have (on average 1.205128205128205) internal successors, (188), 173 states have internal predecessors, (188), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:34:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2025-03-09 02:34:09,686 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 57 [2025-03-09 02:34:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:09,686 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2025-03-09 02:34:09,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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:34:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2025-03-09 02:34:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 02:34:09,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:09,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:09,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:34:09,887 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:34:09,887 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:09,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:09,888 INFO L85 PathProgramCache]: Analyzing trace with hash 105451691, now seen corresponding path program 1 times [2025-03-09 02:34:09,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:09,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503254010] [2025-03-09 02:34:09,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:09,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:34:09,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:34:09,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:09,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:09,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059093925] [2025-03-09 02:34:09,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:09,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:09,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:09,904 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:34:09,905 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:34:09,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:34:09,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:34:09,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:09,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:09,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:34:09,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:10,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:10,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:10,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503254010] [2025-03-09 02:34:10,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:10,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059093925] [2025-03-09 02:34:10,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059093925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:10,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:10,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-09 02:34:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351971425] [2025-03-09 02:34:10,252 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:10,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:34:10,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:10,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:34:10,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:10,253 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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:34:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:10,385 INFO L93 Difference]: Finished difference Result 182 states and 198 transitions. [2025-03-09 02:34:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:34:10,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 77 [2025-03-09 02:34:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:10,386 INFO L225 Difference]: With dead ends: 182 [2025-03-09 02:34:10,386 INFO L226 Difference]: Without dead ends: 180 [2025-03-09 02:34:10,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:10,387 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:10,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 61 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-09 02:34:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-09 02:34:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 156 states have (on average 1.1730769230769231) internal successors, (183), 171 states have internal predecessors, (183), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:34:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2025-03-09 02:34:10,392 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 77 [2025-03-09 02:34:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:10,393 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2025-03-09 02:34:10,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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:34:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2025-03-09 02:34:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 02:34:10,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:10,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:10,399 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:34:10,594 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:34:10,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:10,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1025964848, now seen corresponding path program 1 times [2025-03-09 02:34:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:10,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953521755] [2025-03-09 02:34:10,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:10,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:34:10,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:34:10,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:10,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:10,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166992836] [2025-03-09 02:34:10,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:10,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:10,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:10,611 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:34:10,612 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:34:10,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:34:10,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:34:10,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:10,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:10,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:34:10,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:10,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:10,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953521755] [2025-03-09 02:34:10,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166992836] [2025-03-09 02:34:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166992836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:10,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:10,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-09 02:34:10,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536974511] [2025-03-09 02:34:10,922 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:10,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:34:10,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:10,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:34:10,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:10,923 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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:34:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:11,106 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2025-03-09 02:34:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:34:11,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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 78 [2025-03-09 02:34:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:11,107 INFO L225 Difference]: With dead ends: 189 [2025-03-09 02:34:11,107 INFO L226 Difference]: Without dead ends: 185 [2025-03-09 02:34:11,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:11,107 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:11,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 130 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:34:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-09 02:34:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-09 02:34:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 161 states have (on average 1.1614906832298137) internal successors, (187), 176 states have internal predecessors, (187), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:34:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-03-09 02:34:11,115 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 78 [2025-03-09 02:34:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:11,116 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-03-09 02:34:11,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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:34:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-03-09 02:34:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:34:11,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:11,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:11,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 02:34:11,321 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:34:11,321 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:11,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:11,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1531483673, now seen corresponding path program 1 times [2025-03-09 02:34:11,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:11,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626408482] [2025-03-09 02:34:11,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:11,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:11,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:34:11,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:34:11,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:11,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253401963] [2025-03-09 02:34:11,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:11,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:11,336 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:34:11,337 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:34:11,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:34:11,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:34:11,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:11,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:11,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:34:11,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:11,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:11,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626408482] [2025-03-09 02:34:11,649 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253401963] [2025-03-09 02:34:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253401963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:11,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:11,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-09 02:34:11,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412837155] [2025-03-09 02:34:11,649 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:11,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:34:11,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:11,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:34:11,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:11,650 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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:34:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:11,820 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2025-03-09 02:34:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:34:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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) Word has length 81 [2025-03-09 02:34:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:11,821 INFO L225 Difference]: With dead ends: 186 [2025-03-09 02:34:11,821 INFO L226 Difference]: Without dead ends: 180 [2025-03-09 02:34:11,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:34:11,822 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:11,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:34:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-09 02:34:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-09 02:34:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 156 states have (on average 1.1602564102564104) internal successors, (181), 171 states have internal predecessors, (181), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:34:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2025-03-09 02:34:11,829 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 81 [2025-03-09 02:34:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:11,829 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2025-03-09 02:34:11,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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:34:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2025-03-09 02:34:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-09 02:34:11,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:11,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:11,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:12,030 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:34:12,031 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:12,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:12,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1247819213, now seen corresponding path program 1 times [2025-03-09 02:34:12,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:12,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395599506] [2025-03-09 02:34:12,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:12,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:12,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-09 02:34:12,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 02:34:12,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:12,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924614166] [2025-03-09 02:34:12,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:12,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:12,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:12,045 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:34:12,046 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:34:12,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-09 02:34:12,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 02:34:12,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:12,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:12,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:34:12,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:12,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:12,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395599506] [2025-03-09 02:34:12,327 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:12,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924614166] [2025-03-09 02:34:12,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924614166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:12,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:34:12,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 02:34:12,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598725888] [2025-03-09 02:34:12,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:12,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:34:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:12,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:34:12,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:12,328 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 8 states, 7 states have (on average 20.857142857142858) internal successors, (146), 8 states have internal predecessors, (146), 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:34:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:12,520 INFO L93 Difference]: Finished difference Result 227 states and 245 transitions. [2025-03-09 02:34:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:34:12,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 20.857142857142858) internal successors, (146), 8 states have internal predecessors, (146), 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) Word has length 82 [2025-03-09 02:34:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:12,521 INFO L225 Difference]: With dead ends: 227 [2025-03-09 02:34:12,521 INFO L226 Difference]: Without dead ends: 210 [2025-03-09 02:34:12,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:12,522 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 186 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:12,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 146 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:34:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-09 02:34:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 173. [2025-03-09 02:34:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 154 states have (on average 1.103896103896104) internal successors, (170), 165 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:34:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 178 transitions. [2025-03-09 02:34:12,528 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 178 transitions. Word has length 82 [2025-03-09 02:34:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:12,528 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 178 transitions. [2025-03-09 02:34:12,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 20.857142857142858) internal successors, (146), 8 states have internal predecessors, (146), 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:34:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2025-03-09 02:34:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 02:34:12,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:12,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:34:12,535 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:34:12,729 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:34:12,730 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:12,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2108284964, now seen corresponding path program 1 times [2025-03-09 02:34:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:12,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522190402] [2025-03-09 02:34:12,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:12,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:12,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 02:34:12,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 02:34:12,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:12,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:12,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313527091] [2025-03-09 02:34:12,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:12,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:12,755 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:34:12,767 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:34:12,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 02:34:12,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 02:34:12,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:12,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:12,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:34:12,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:13,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522190402] [2025-03-09 02:34:13,400 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:13,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313527091] [2025-03-09 02:34:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313527091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:13,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:34:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 02:34:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175385] [2025-03-09 02:34:13,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:13,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:34:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:13,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:34:13,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:13,403 INFO L87 Difference]: Start difference. First operand 173 states and 178 transitions. Second operand has 8 states, 7 states have (on average 23.714285714285715) internal successors, (166), 8 states have internal predecessors, (166), 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:34:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:13,989 INFO L93 Difference]: Finished difference Result 369 states and 414 transitions. [2025-03-09 02:34:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:34:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.714285714285715) internal successors, (166), 8 states have internal predecessors, (166), 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) Word has length 92 [2025-03-09 02:34:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:13,990 INFO L225 Difference]: With dead ends: 369 [2025-03-09 02:34:13,990 INFO L226 Difference]: Without dead ends: 363 [2025-03-09 02:34:13,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:13,991 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 222 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:13,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 198 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:34:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-09 02:34:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 305. [2025-03-09 02:34:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 283 states have (on average 1.137809187279152) internal successors, (322), 293 states have internal predecessors, (322), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:34:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 338 transitions. [2025-03-09 02:34:14,004 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 338 transitions. Word has length 92 [2025-03-09 02:34:14,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:14,004 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 338 transitions. [2025-03-09 02:34:14,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.714285714285715) internal successors, (166), 8 states have internal predecessors, (166), 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:34:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 338 transitions. [2025-03-09 02:34:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 02:34:14,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:14,005 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:14,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:14,209 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:34:14,209 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:14,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1684349421, now seen corresponding path program 1 times [2025-03-09 02:34:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68091230] [2025-03-09 02:34:14,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:14,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:34:14,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:34:14,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:14,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291471927] [2025-03-09 02:34:14,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:14,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:14,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:14,225 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:34:14,227 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:34:14,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:34:14,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:34:14,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:14,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:14,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:34:14,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:14,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:14,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68091230] [2025-03-09 02:34:14,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:14,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291471927] [2025-03-09 02:34:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291471927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:14,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:14,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-09 02:34:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028939980] [2025-03-09 02:34:14,626 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:14,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:34:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:14,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:34:14,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:14,627 INFO L87 Difference]: Start difference. First operand 305 states and 338 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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:34:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:14,808 INFO L93 Difference]: Finished difference Result 312 states and 343 transitions. [2025-03-09 02:34:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:34:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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 95 [2025-03-09 02:34:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:14,809 INFO L225 Difference]: With dead ends: 312 [2025-03-09 02:34:14,809 INFO L226 Difference]: Without dead ends: 306 [2025-03-09 02:34:14,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:34:14,810 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 31 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:14,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 177 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:34:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-09 02:34:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2025-03-09 02:34:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 283 states have (on average 1.1307420494699647) internal successors, (320), 293 states have internal predecessors, (320), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:34:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 336 transitions. [2025-03-09 02:34:14,829 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 336 transitions. Word has length 95 [2025-03-09 02:34:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:14,830 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 336 transitions. [2025-03-09 02:34:14,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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:34:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 336 transitions. [2025-03-09 02:34:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-09 02:34:14,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:14,830 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-09 02:34:14,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:15,035 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:34:15,035 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:15,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash 251627365, now seen corresponding path program 1 times [2025-03-09 02:34:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123113554] [2025-03-09 02:34:15,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:15,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:15,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-09 02:34:15,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-09 02:34:15,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:15,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-09 02:34:15,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123113554] [2025-03-09 02:34:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123113554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157779755] [2025-03-09 02:34:15,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:15,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:15,127 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:34:15,128 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:34:15,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-09 02:34:15,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-09 02:34:15,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:15,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:15,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:34:15,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:34:15,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:34:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157779755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:15,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:34:15,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2025-03-09 02:34:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419066494] [2025-03-09 02:34:15,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:15,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:34:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:15,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:34:15,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:15,371 INFO L87 Difference]: Start difference. First operand 305 states and 336 transitions. Second operand has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 10 states have internal predecessors, (253), 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:34:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:15,450 INFO L93 Difference]: Finished difference Result 331 states and 355 transitions. [2025-03-09 02:34:15,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:34:15,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 10 states have internal predecessors, (253), 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) Word has length 120 [2025-03-09 02:34:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:15,452 INFO L225 Difference]: With dead ends: 331 [2025-03-09 02:34:15,452 INFO L226 Difference]: Without dead ends: 330 [2025-03-09 02:34:15,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=122, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:34:15,453 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 166 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:15,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 281 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-09 02:34:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 304. [2025-03-09 02:34:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 283 states have (on average 1.11660777385159) internal successors, (316), 292 states have internal predecessors, (316), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:34:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 332 transitions. [2025-03-09 02:34:15,466 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 332 transitions. Word has length 120 [2025-03-09 02:34:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:15,466 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 332 transitions. [2025-03-09 02:34:15,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 10 states have internal predecessors, (253), 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:34:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 332 transitions. [2025-03-09 02:34:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-09 02:34:15,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:15,467 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-03-09 02:34:15,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 02:34:15,668 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:34:15,668 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 02:34:15,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash 722397311, now seen corresponding path program 1 times [2025-03-09 02:34:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:15,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768874250] [2025-03-09 02:34:15,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:15,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-09 02:34:15,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-09 02:34:15,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:15,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:34:15,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:15,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768874250] [2025-03-09 02:34:15,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768874250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:15,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876468675] [2025-03-09 02:34:15,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:15,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:15,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:15,823 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:34:15,824 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:34:15,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-09 02:34:15,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-09 02:34:15,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:15,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:15,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:34:15,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 120 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:15,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:34:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876468675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:16,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:34:16,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2025-03-09 02:34:16,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76473887] [2025-03-09 02:34:16,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:16,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:34:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:16,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:34:16,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:34:16,075 INFO L87 Difference]: Start difference. First operand 304 states and 332 transitions. Second operand has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 3 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:34:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:16,145 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2025-03-09 02:34:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:34:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 3 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 126 [2025-03-09 02:34:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:16,148 INFO L225 Difference]: With dead ends: 308 [2025-03-09 02:34:16,148 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:34:16,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 245 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:34:16,149 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:16,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 491 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:34:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:34:16,150 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:34:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:34:16,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2025-03-09 02:34:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:16,150 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:34:16,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 3 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:34:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:34:16,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:34:16,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 62 remaining) [2025-03-09 02:34:16,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 62 remaining) [2025-03-09 02:34:16,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 62 remaining) [2025-03-09 02:34:16,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 62 remaining) [2025-03-09 02:34:16,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 62 remaining) [2025-03-09 02:34:16,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 62 remaining) [2025-03-09 02:34:16,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 62 remaining) [2025-03-09 02:34:16,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 62 remaining) [2025-03-09 02:34:16,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 62 remaining) [2025-03-09 02:34:16,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 62 remaining) [2025-03-09 02:34:16,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 62 remaining) [2025-03-09 02:34:16,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 62 remaining) [2025-03-09 02:34:16,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 62 remaining) [2025-03-09 02:34:16,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 62 remaining) [2025-03-09 02:34:16,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 62 remaining) [2025-03-09 02:34:16,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 62 remaining) [2025-03-09 02:34:16,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 62 remaining) [2025-03-09 02:34:16,165 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:34:16,359 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:34:16,362 INFO L422 BasicCegarLoop]: Path program histogram: [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:34:16,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:34:16,490 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:34:16,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:34:16 BoogieIcfgContainer [2025-03-09 02:34:16,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:34:16,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:34:16,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:34:16,505 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:34:16,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:34:03" (3/4) ... [2025-03-09 02:34:16,506 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:34:16,511 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:34:16,516 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:34:16,516 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:34:16,516 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:34:16,516 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:34:16,584 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:34:16,584 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:34:16,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:34:16,585 INFO L158 Benchmark]: Toolchain (without parser) took 13434.43ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 139.9MB in the end (delta: -26.3MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2025-03-09 02:34:16,586 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:34:16,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.17ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:34:16,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.88ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 100.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:34:16,588 INFO L158 Benchmark]: Boogie Preprocessor took 16.17ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.5MB in the end (delta: 910.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:34:16,588 INFO L158 Benchmark]: IcfgBuilder took 358.54ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 77.3MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 02:34:16,588 INFO L158 Benchmark]: TraceAbstraction took 12802.40ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 76.8MB in the beginning and 146.4MB in the end (delta: -69.6MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2025-03-09 02:34:16,588 INFO L158 Benchmark]: Witness Printer took 79.70ms. Allocated memory is still 176.2MB. Free memory was 146.4MB in the beginning and 139.9MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:34:16,589 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.17ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.88ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 100.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.17ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.5MB in the end (delta: 910.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 358.54ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 77.3MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12802.40ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 76.8MB in the beginning and 146.4MB in the end (delta: -69.6MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Witness Printer took 79.70ms. Allocated memory is still 176.2MB. Free memory was 146.4MB in the beginning and 139.9MB in the end (delta: 6.6MB). 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: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: 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: 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: 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: 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: 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, 142 locations, 150 edges, 62 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1904 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1882 mSDsluCounter, 4924 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3191 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4271 IncrementalHoareTripleChecker+Invalid, 4458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 1733 mSDtfsCounter, 4271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1881 GetRequests, 1735 SyntacticMatches, 9 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=19, InterpolantAutomatonStates: 127, 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, 314 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2346 NumberOfCodeBlocks, 2346 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2169 ConstructedInterpolants, 0 QuantifiedInterpolants, 9398 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1881 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 34 InterpolantComputations, 12 PerfectInterpolantSequences, 538/1075 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 62 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((((((((((8 <= x) && (k <= 32767)) && (x <= 2305843009213693951)) && (2 == y)) && (0 <= c)) && (c <= 2)) && (1 <= k)) && (counter == 2)) || (((((c == 0) && (k <= 32767)) && (y == 0)) && (counter == 0)) && (x == 0))) || (((((((k <= 32767) && (c <= 1)) && (x == 1)) && (0 <= c)) && (y == 1)) && (1 <= k)) && (counter == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:34:16,607 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