./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound20.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 070b005151a155625f2a1d89ebf21c03a6d381af2d7b663a2fe06061e79da5f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:26:25,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:26:25,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:26:25,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:26:25,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:26:25,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:26:25,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:26:25,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:26:25,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:26:25,211 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:26:25,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:26:25,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:26:25,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:26:25,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:26:25,212 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:26:25,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:26:25,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:26:25,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:26:25,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:26:25,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:26:25,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:26:25,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:26:25,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:26:25,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:26:25,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:26:25,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:26:25,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:26:25,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:26:25,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:26:25,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:26:25,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:26:25,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:26:25,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:26:25,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:26:25,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:26:25,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:26:25,216 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 -> 070b005151a155625f2a1d89ebf21c03a6d381af2d7b663a2fe06061e79da5f4 [2025-03-04 11:26:25,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:26:25,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:26:25,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:26:25,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:26:25,456 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:26:25,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound20.c [2025-03-04 11:26:26,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd48f68f/86437af0b04f4da289effbe07199d9a4/FLAG248518a87 [2025-03-04 11:26:26,843 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:26:26,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound20.c [2025-03-04 11:26:26,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd48f68f/86437af0b04f4da289effbe07199d9a4/FLAG248518a87 [2025-03-04 11:26:27,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd48f68f/86437af0b04f4da289effbe07199d9a4 [2025-03-04 11:26:27,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:26:27,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:26:27,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:26:27,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:26:27,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:26:27,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27, skipping insertion in model container [2025-03-04 11:26:27,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:26:27,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:26:27,351 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:26:27,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:26:27,378 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:26:27,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27 WrapperNode [2025-03-04 11:26:27,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:26:27,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:26:27,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:26:27,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:26:27,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,406 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2025-03-04 11:26:27,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:26:27,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:26:27,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:26:27,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:26:27,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,420 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-04 11:26:27,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:26:27,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:26:27,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:26:27,426 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:26:27,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (1/1) ... [2025-03-04 11:26:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:26:27,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:27,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:26:27,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:26:27,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:26:27,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:26:27,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:26:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:26:27,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:26:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:26:27,509 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:26:27,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:26:27,731 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-04 11:26:27,731 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:26:27,743 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:26:27,744 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:26:27,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:26:27 BoogieIcfgContainer [2025-03-04 11:26:27,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:26:27,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:26:27,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:26:27,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:26:27,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:26:27" (1/3) ... [2025-03-04 11:26:27,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e88ec81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:26:27, skipping insertion in model container [2025-03-04 11:26:27,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:27" (2/3) ... [2025-03-04 11:26:27,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e88ec81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:26:27, skipping insertion in model container [2025-03-04 11:26:27,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:26:27" (3/3) ... [2025-03-04 11:26:27,753 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound20.c [2025-03-04 11:26:27,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:26:27,765 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt1-ll_valuebound20.c that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 50 error locations. [2025-03-04 11:26:27,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:26:27,807 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;@bbad235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:26:27,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 11:26:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 113 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:26:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 11:26:27,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:27,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 11:26:27,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:27,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash 139295727, now seen corresponding path program 1 times [2025-03-04 11:26:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207676874] [2025-03-04 11:26:27,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:27,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 11:26:27,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 11:26:27,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:27,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:27,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:27,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207676874] [2025-03-04 11:26:27,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207676874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:27,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:27,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:26:27,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022791746] [2025-03-04 11:26:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:27,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:26:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:27,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:26:27,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:26:27,923 INFO L87 Difference]: Start difference. First operand has 121 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 113 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:26:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:27,945 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2025-03-04 11:26:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:26:27,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 11:26:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:27,952 INFO L225 Difference]: With dead ends: 234 [2025-03-04 11:26:27,952 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 11:26:27,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:26:27,958 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:27,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:26:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 11:26:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 11:26:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 58 states have (on average 1.793103448275862) internal successors, (104), 103 states have internal predecessors, (104), 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-04 11:26:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-03-04 11:26:27,992 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 5 [2025-03-04 11:26:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:27,993 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-03-04 11:26:27,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:26:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-03-04 11:26:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 11:26:27,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:27,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 11:26:27,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:26:27,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:27,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash 139296688, now seen corresponding path program 1 times [2025-03-04 11:26:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:27,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819364186] [2025-03-04 11:26:27,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:27,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 11:26:28,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 11:26:28,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:28,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:28,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:28,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819364186] [2025-03-04 11:26:28,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819364186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:28,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:28,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:26:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972584427] [2025-03-04 11:26:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:28,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:26:28,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:28,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:26:28,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:26:28,066 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:26:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:28,210 INFO L93 Difference]: Finished difference Result 204 states and 213 transitions. [2025-03-04 11:26:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:26:28,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 11:26:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:28,212 INFO L225 Difference]: With dead ends: 204 [2025-03-04 11:26:28,212 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 11:26:28,212 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-04 11:26:28,213 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:28,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 162 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 11:26:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 149. [2025-03-04 11:26:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.6236559139784945) internal successors, (151), 138 states have internal predecessors, (151), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:26:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2025-03-04 11:26:28,230 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 5 [2025-03-04 11:26:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:28,230 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2025-03-04 11:26:28,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:26:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2025-03-04 11:26:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:26:28,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:28,230 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] [2025-03-04 11:26:28,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:26:28,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:28,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash 952605627, now seen corresponding path program 1 times [2025-03-04 11:26:28,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:28,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342540406] [2025-03-04 11:26:28,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:28,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:26:28,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:26:28,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:28,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:26:28,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752318952] [2025-03-04 11:26:28,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:28,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:28,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:28,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:28,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:26:28,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:26:28,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:26:28,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:28,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:28,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:26:28,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:26:28,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:26:28,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:28,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342540406] [2025-03-04 11:26:28,336 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:26:28,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752318952] [2025-03-04 11:26:28,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752318952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:28,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:28,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:26:28,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204397406] [2025-03-04 11:26:28,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:28,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:26:28,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:28,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:26:28,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:26:28,338 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:26:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:28,449 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2025-03-04 11:26:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:26:28,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-04 11:26:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:28,450 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:26:28,451 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 11:26:28,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:26:28,451 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:28,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 148 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 11:26:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2025-03-04 11:26:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 103 states have (on average 1.5728155339805825) internal successors, (162), 148 states have internal predecessors, (162), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:26:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2025-03-04 11:26:28,458 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 26 [2025-03-04 11:26:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:28,458 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2025-03-04 11:26:28,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:26:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2025-03-04 11:26:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:26:28,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:28,459 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] [2025-03-04 11:26:28,465 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-04 11:26:28,659 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-04 11:26:28,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:28,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash -533996582, now seen corresponding path program 1 times [2025-03-04 11:26:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936293482] [2025-03-04 11:26:28,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:28,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:26:28,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:26:28,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:28,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:26:28,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:28,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936293482] [2025-03-04 11:26:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936293482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:28,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:28,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:26:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368474337] [2025-03-04 11:26:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:28,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:26:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:28,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:26:28,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:26:28,729 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:26:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:28,805 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2025-03-04 11:26:28,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:26:28,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-04 11:26:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:28,806 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:26:28,806 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 11:26:28,806 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-04 11:26:28,808 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:28,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 162 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 11:26:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2025-03-04 11:26:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.490566037735849) internal successors, (158), 151 states have internal predecessors, (158), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:26:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2025-03-04 11:26:28,822 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 27 [2025-03-04 11:26:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:28,822 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2025-03-04 11:26:28,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:26:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2025-03-04 11:26:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:26:28,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:28,823 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] [2025-03-04 11:26:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:26:28,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:28,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 266740599, now seen corresponding path program 1 times [2025-03-04 11:26:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572103593] [2025-03-04 11:26:28,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:28,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:26:28,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:26:28,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:28,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:26:28,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:28,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572103593] [2025-03-04 11:26:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572103593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:28,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:26:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951313703] [2025-03-04 11:26:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:28,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:26:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:28,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:26:28,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:26:28,929 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:26:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:29,051 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2025-03-04 11:26:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:26:29,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-04 11:26:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:29,052 INFO L225 Difference]: With dead ends: 168 [2025-03-04 11:26:29,052 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 11:26:29,052 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-04 11:26:29,052 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 46 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:29,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 211 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 11:26:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2025-03-04 11:26:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.471698113207547) internal successors, (156), 151 states have internal predecessors, (156), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:26:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2025-03-04 11:26:29,058 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 30 [2025-03-04 11:26:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:29,059 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2025-03-04 11:26:29,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:26:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2025-03-04 11:26:29,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:26:29,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:29,059 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] [2025-03-04 11:26:29,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:26:29,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:29,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1598117069, now seen corresponding path program 1 times [2025-03-04 11:26:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:29,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717610554] [2025-03-04 11:26:29,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:29,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:26:29,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:26:29,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:29,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:26:29,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717610554] [2025-03-04 11:26:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717610554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:29,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:29,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:26:29,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595526031] [2025-03-04 11:26:29,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:29,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:26:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:29,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:26:29,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:26:29,129 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:26:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:29,218 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2025-03-04 11:26:29,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:26:29,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-03-04 11:26:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:29,220 INFO L225 Difference]: With dead ends: 168 [2025-03-04 11:26:29,220 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 11:26:29,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:26:29,220 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:29,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 11:26:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-04 11:26:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 130 states have internal predecessors, (131), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:26:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2025-03-04 11:26:29,228 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 34 [2025-03-04 11:26:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:29,229 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2025-03-04 11:26:29,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:26:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2025-03-04 11:26:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 11:26:29,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:29,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:29,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:26:29,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:29,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash 751588979, now seen corresponding path program 1 times [2025-03-04 11:26:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:29,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197078276] [2025-03-04 11:26:29,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:29,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:29,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:26:29,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:26:29,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:29,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:26:29,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:29,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197078276] [2025-03-04 11:26:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197078276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:29,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:29,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:26:29,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928912941] [2025-03-04 11:26:29,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:29,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:26:29,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:29,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:26:29,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:26:29,331 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:26:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:29,437 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2025-03-04 11:26:29,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:26:29,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-04 11:26:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:29,438 INFO L225 Difference]: With dead ends: 143 [2025-03-04 11:26:29,438 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 11:26:29,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:26:29,439 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:29,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 11:26:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-03-04 11:26:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 131 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:26:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2025-03-04 11:26:29,444 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 47 [2025-03-04 11:26:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:29,444 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2025-03-04 11:26:29,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:26:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2025-03-04 11:26:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:26:29,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:29,445 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:29,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:26:29,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:29,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1824421889, now seen corresponding path program 1 times [2025-03-04 11:26:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:29,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7536125] [2025-03-04 11:26:29,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:29,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:26:29,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:26:29,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:29,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:26:29,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:29,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7536125] [2025-03-04 11:26:29,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7536125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:29,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:29,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:26:29,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308613652] [2025-03-04 11:26:29,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:29,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:26:29,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:29,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:26:29,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:26:29,559 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:26:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:29,631 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2025-03-04 11:26:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:26:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-04 11:26:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:29,634 INFO L225 Difference]: With dead ends: 143 [2025-03-04 11:26:29,634 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 11:26:29,634 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-04 11:26:29,635 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:29,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 11:26:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-04 11:26:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.528735632183908) internal successors, (133), 132 states have internal predecessors, (133), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:26:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2025-03-04 11:26:29,640 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 48 [2025-03-04 11:26:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:29,641 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2025-03-04 11:26:29,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:26:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2025-03-04 11:26:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 11:26:29,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:29,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:29,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:26:29,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:29,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 722503790, now seen corresponding path program 1 times [2025-03-04 11:26:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232696962] [2025-03-04 11:26:29,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:29,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:26:29,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:26:29,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:29,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:26:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232696962] [2025-03-04 11:26:29,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232696962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:29,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332981308] [2025-03-04 11:26:29,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:29,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:29,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:29,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:29,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:26:29,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:26:29,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:26:29,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:29,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:29,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:26:29,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:26:29,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:26:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332981308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:29,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:26:29,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:26:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4102381] [2025-03-04 11:26:29,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:29,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:26:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:29,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:26:29,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:26:29,806 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:26:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:29,894 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2025-03-04 11:26:29,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:26:29,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-04 11:26:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:29,896 INFO L225 Difference]: With dead ends: 142 [2025-03-04 11:26:29,896 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 11:26:29,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:26:29,896 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 120 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:29,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 117 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 11:26:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-04 11:26:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 123 states have internal predecessors, (124), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:26:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2025-03-04 11:26:29,902 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 49 [2025-03-04 11:26:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:29,902 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2025-03-04 11:26:29,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:26:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2025-03-04 11:26:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:26:29,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:29,903 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 11:26:29,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:26:30,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 11:26:30,108 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:30,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 922781087, now seen corresponding path program 1 times [2025-03-04 11:26:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:30,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238423541] [2025-03-04 11:26:30,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:30,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:26:30,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:26:30,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:30,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:26:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238423541] [2025-03-04 11:26:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238423541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58443582] [2025-03-04 11:26:30,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:30,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:30,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:30,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:30,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:26:30,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:26:30,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:26:30,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:30,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:30,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:26:30,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:26:30,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:26:30,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58443582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:30,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:30,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:26:30,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831327369] [2025-03-04 11:26:30,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:30,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:26:30,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:30,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:26:30,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:26:30,300 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 7 states, 6 states have (on average 16.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 11:26:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:30,409 INFO L93 Difference]: Finished difference Result 226 states and 255 transitions. [2025-03-04 11:26:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:26:30,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 50 [2025-03-04 11:26:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:30,412 INFO L225 Difference]: With dead ends: 226 [2025-03-04 11:26:30,412 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 11:26:30,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:26:30,413 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 180 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:30,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 206 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 11:26:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 124. [2025-03-04 11:26:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 114 states have internal predecessors, (115), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:26:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2025-03-04 11:26:30,419 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 50 [2025-03-04 11:26:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:30,419 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2025-03-04 11:26:30,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 11:26:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2025-03-04 11:26:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 11:26:30,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:30,420 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 11:26:30,426 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-04 11:26:30,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:30,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:30,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:30,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1548243856, now seen corresponding path program 1 times [2025-03-04 11:26:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:30,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735229502] [2025-03-04 11:26:30,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:30,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 11:26:30,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 11:26:30,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:30,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:26:30,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219740427] [2025-03-04 11:26:30,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:30,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:30,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:30,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:30,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:26:30,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 11:26:30,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 11:26:30,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:30,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:30,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:26:30,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:26:30,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:26:30,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:30,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735229502] [2025-03-04 11:26:30,854 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:26:30,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219740427] [2025-03-04 11:26:30,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219740427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:30,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:26:30,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 11:26:30,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312458560] [2025-03-04 11:26:30,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:30,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:26:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:30,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:26:30,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:26:30,856 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:26:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:31,006 INFO L93 Difference]: Finished difference Result 300 states and 322 transitions. [2025-03-04 11:26:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:26:31,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 63 [2025-03-04 11:26:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:31,007 INFO L225 Difference]: With dead ends: 300 [2025-03-04 11:26:31,007 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 11:26:31,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:26:31,008 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 237 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:31,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 305 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 11:26:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 198. [2025-03-04 11:26:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.3806451612903226) internal successors, (214), 181 states have internal predecessors, (214), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 11:26:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2025-03-04 11:26:31,019 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 63 [2025-03-04 11:26:31,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:31,019 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2025-03-04 11:26:31,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:26:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2025-03-04 11:26:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 11:26:31,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:31,020 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:31,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:26:31,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:31,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:31,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2097539651, now seen corresponding path program 1 times [2025-03-04 11:26:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441272977] [2025-03-04 11:26:31,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:31,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:26:31,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:26:31,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:31,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:26:31,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817758281] [2025-03-04 11:26:31,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:31,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:31,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:31,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:31,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:26:31,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:26:31,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:26:31,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:31,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:31,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:26:31,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:31,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:31,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441272977] [2025-03-04 11:26:31,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:26:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817758281] [2025-03-04 11:26:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817758281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:31,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:26:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 11:26:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435199135] [2025-03-04 11:26:31,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:31,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:26:31,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:31,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:26:31,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:26:31,446 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:26:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:31,629 INFO L93 Difference]: Finished difference Result 258 states and 321 transitions. [2025-03-04 11:26:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:26:31,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 70 [2025-03-04 11:26:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:31,631 INFO L225 Difference]: With dead ends: 258 [2025-03-04 11:26:31,631 INFO L226 Difference]: Without dead ends: 250 [2025-03-04 11:26:31,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:26:31,631 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 218 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:31,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 208 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-04 11:26:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 194. [2025-03-04 11:26:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 157 states have (on average 1.267515923566879) internal successors, (199), 176 states have internal predecessors, (199), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 11:26:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2025-03-04 11:26:31,642 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 70 [2025-03-04 11:26:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:31,642 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2025-03-04 11:26:31,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:26:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2025-03-04 11:26:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 11:26:31,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:31,643 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1] [2025-03-04 11:26:31,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:31,843 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,SelfDestructingSolverStorable11 [2025-03-04 11:26:31,844 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:31,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:31,844 INFO L85 PathProgramCache]: Analyzing trace with hash -599219688, now seen corresponding path program 1 times [2025-03-04 11:26:31,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343383024] [2025-03-04 11:26:31,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:31,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 11:26:31,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 11:26:31,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:31,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343383024] [2025-03-04 11:26:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343383024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710331612] [2025-03-04 11:26:31,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:31,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:31,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:31,922 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:31,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:26:31,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 11:26:31,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 11:26:31,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:31,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:31,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:26:31,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:32,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710331612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:32,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:32,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 11:26:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824478232] [2025-03-04 11:26:32,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:32,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:26:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:32,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:26:32,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:26:32,215 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:26:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:32,387 INFO L93 Difference]: Finished difference Result 194 states and 231 transitions. [2025-03-04 11:26:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:26:32,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 71 [2025-03-04 11:26:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:32,389 INFO L225 Difference]: With dead ends: 194 [2025-03-04 11:26:32,390 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 11:26:32,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:26:32,391 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 159 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:32,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 192 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:32,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 11:26:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-04 11:26:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 173 states have internal predecessors, (192), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 11:26:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 224 transitions. [2025-03-04 11:26:32,401 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 224 transitions. Word has length 71 [2025-03-04 11:26:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:32,402 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 224 transitions. [2025-03-04 11:26:32,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:26:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 224 transitions. [2025-03-04 11:26:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 11:26:32,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:32,403 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1] [2025-03-04 11:26:32,408 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-04 11:26:32,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:32,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:32,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:32,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1395941093, now seen corresponding path program 1 times [2025-03-04 11:26:32,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:32,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-03-04 11:26:32,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:32,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 11:26:32,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:26:32,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:32,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:32,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-03-04 11:26:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216378467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087301111] [2025-03-04 11:26:32,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:32,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:32,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:32,717 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:32,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:26:32,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 11:26:32,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:26:32,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:32,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:32,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:26:32,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:32,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:32,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087301111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:32,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:32,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 11:26:32,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268162598] [2025-03-04 11:26:32,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:32,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:26:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:32,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:26:32,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:26:32,957 INFO L87 Difference]: Start difference. First operand 191 states and 224 transitions. Second operand has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:26:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:33,134 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2025-03-04 11:26:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:26:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 72 [2025-03-04 11:26:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:33,135 INFO L225 Difference]: With dead ends: 217 [2025-03-04 11:26:33,135 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 11:26:33,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:26:33,136 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 96 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:33,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 222 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 11:26:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 184. [2025-03-04 11:26:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 157 states have (on average 1.1210191082802548) internal successors, (176), 166 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 11:26:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2025-03-04 11:26:33,144 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 72 [2025-03-04 11:26:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:33,145 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2025-03-04 11:26:33,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:26:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2025-03-04 11:26:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 11:26:33,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:33,146 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2025-03-04 11:26:33,151 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-04 11:26:33,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:33,350 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:33,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1469592455, now seen corresponding path program 1 times [2025-03-04 11:26:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:33,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882485429] [2025-03-04 11:26:33,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:33,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:26:33,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:26:33,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:33,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882485429] [2025-03-04 11:26:33,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882485429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001350071] [2025-03-04 11:26:33,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:33,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:33,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:26:33,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:26:33,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:26:33,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:33,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:33,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:26:33,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:26:33,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:26:33,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001350071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:33,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:26:33,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:26:33,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765751348] [2025-03-04 11:26:33,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:33,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:26:33,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:33,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:26:33,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:26:33,643 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:26:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:33,719 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2025-03-04 11:26:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:26:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-03-04 11:26:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:33,720 INFO L225 Difference]: With dead ends: 184 [2025-03-04 11:26:33,720 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 11:26:33,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:26:33,721 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:33,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 107 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 11:26:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 11:26:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.037037037037037) internal successors, (140), 138 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 11:26:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2025-03-04 11:26:33,728 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 74 [2025-03-04 11:26:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2025-03-04 11:26:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:26:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2025-03-04 11:26:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 11:26:33,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:33,729 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1] [2025-03-04 11:26:33,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:33,929 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,SelfDestructingSolverStorable14 [2025-03-04 11:26:33,930 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:33,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:33,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1057723909, now seen corresponding path program 1 times [2025-03-04 11:26:33,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:33,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563583361] [2025-03-04 11:26:33,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:33,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:33,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 11:26:33,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 11:26:33,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:26:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563583361] [2025-03-04 11:26:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563583361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014518153] [2025-03-04 11:26:34,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:34,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:34,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:34,072 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:34,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:26:34,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 11:26:34,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 11:26:34,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:34,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:34,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:26:34,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:26:34,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:26:34,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014518153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:34,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:34,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 11:26:34,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722466656] [2025-03-04 11:26:34,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:34,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:26:34,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:34,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:26:34,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:26:34,584 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 20 states, 19 states have (on average 14.210526315789474) internal successors, (270), 20 states have internal predecessors, (270), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 11:26:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:34,821 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2025-03-04 11:26:34,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:26:34,821 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.210526315789474) internal successors, (270), 20 states have internal predecessors, (270), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 136 [2025-03-04 11:26:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:34,823 INFO L225 Difference]: With dead ends: 239 [2025-03-04 11:26:34,823 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 11:26:34,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:26:34,824 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:34,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 11:26:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2025-03-04 11:26:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 210 states have (on average 1.0523809523809524) internal successors, (221), 213 states have internal predecessors, (221), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 11:26:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 263 transitions. [2025-03-04 11:26:34,836 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 263 transitions. Word has length 136 [2025-03-04 11:26:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:34,836 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 263 transitions. [2025-03-04 11:26:34,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.210526315789474) internal successors, (270), 20 states have internal predecessors, (270), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 11:26:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 263 transitions. [2025-03-04 11:26:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 11:26:34,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:34,839 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 11:26:34,845 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-04 11:26:35,039 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,SelfDestructingSolverStorable15 [2025-03-04 11:26:35,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:35,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1642066719, now seen corresponding path program 2 times [2025-03-04 11:26:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:35,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726016132] [2025-03-04 11:26:35,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:35,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:35,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-04 11:26:35,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 11:26:35,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:35,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:26:35,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:35,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726016132] [2025-03-04 11:26:35,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726016132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:35,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731044689] [2025-03-04 11:26:35,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:35,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:35,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:35,223 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:35,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:26:35,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-04 11:26:35,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 11:26:35,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:35,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:35,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:26:35,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:26:35,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:26:35,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731044689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:35,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:35,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 11:26:35,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213523823] [2025-03-04 11:26:35,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:35,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 11:26:35,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:35,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 11:26:35,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:26:35,766 INFO L87 Difference]: Start difference. First operand 236 states and 263 transitions. Second operand has 22 states, 21 states have (on average 14.19047619047619) internal successors, (298), 22 states have internal predecessors, (298), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 11:26:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:36,089 INFO L93 Difference]: Finished difference Result 257 states and 284 transitions. [2025-03-04 11:26:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:26:36,089 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.19047619047619) internal successors, (298), 22 states have internal predecessors, (298), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 160 [2025-03-04 11:26:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:36,091 INFO L225 Difference]: With dead ends: 257 [2025-03-04 11:26:36,091 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 11:26:36,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:26:36,092 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 75 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:36,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 264 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 11:26:36,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2025-03-04 11:26:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 224 states have (on average 1.0446428571428572) internal successors, (234), 227 states have internal predecessors, (234), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 11:26:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 280 transitions. [2025-03-04 11:26:36,103 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 280 transitions. Word has length 160 [2025-03-04 11:26:36,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:36,103 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 280 transitions. [2025-03-04 11:26:36,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.19047619047619) internal successors, (298), 22 states have internal predecessors, (298), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 11:26:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 280 transitions. [2025-03-04 11:26:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 11:26:36,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:36,105 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 11:26:36,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:36,310 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,SelfDestructingSolverStorable16 [2025-03-04 11:26:36,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:36,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:36,311 INFO L85 PathProgramCache]: Analyzing trace with hash -175768790, now seen corresponding path program 2 times [2025-03-04 11:26:36,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:36,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693545338] [2025-03-04 11:26:36,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:36,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:36,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 195 statements into 2 equivalence classes. [2025-03-04 11:26:36,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 11:26:36,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:36,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:26:36,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642600593] [2025-03-04 11:26:36,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:36,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:36,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:36,351 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:36,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:26:36,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 195 statements into 2 equivalence classes. [2025-03-04 11:26:36,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 11:26:36,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:36,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:36,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:26:36,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:26:36,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:26:36,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:36,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693545338] [2025-03-04 11:26:36,804 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:26:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642600593] [2025-03-04 11:26:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642600593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:36,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:26:36,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 11:26:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376097243] [2025-03-04 11:26:36,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:36,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:26:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:36,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:26:36,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:26:36,807 INFO L87 Difference]: Start difference. First operand 252 states and 280 transitions. Second operand has 12 states, 11 states have (on average 23.636363636363637) internal successors, (260), 12 states have internal predecessors, (260), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 11:26:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:37,129 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2025-03-04 11:26:37,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:26:37,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.636363636363637) internal successors, (260), 12 states have internal predecessors, (260), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 195 [2025-03-04 11:26:37,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:37,131 INFO L225 Difference]: With dead ends: 354 [2025-03-04 11:26:37,131 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 11:26:37,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:26:37,132 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 142 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:37,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 661 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:26:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 11:26:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 343. [2025-03-04 11:26:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 307 states have (on average 1.0456026058631922) internal successors, (321), 310 states have internal predecessors, (321), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 11:26:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 383 transitions. [2025-03-04 11:26:37,143 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 383 transitions. Word has length 195 [2025-03-04 11:26:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:37,144 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 383 transitions. [2025-03-04 11:26:37,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.636363636363637) internal successors, (260), 12 states have internal predecessors, (260), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 11:26:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 383 transitions. [2025-03-04 11:26:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-04 11:26:37,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:37,145 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 11:26:37,151 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-04 11:26:37,345 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,SelfDestructingSolverStorable17 [2025-03-04 11:26:37,346 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:37,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:37,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1119003075, now seen corresponding path program 2 times [2025-03-04 11:26:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:37,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950427132] [2025-03-04 11:26:37,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:37,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 11:26:37,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 11:26:37,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:37,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:26:37,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049328730] [2025-03-04 11:26:37,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:37,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:37,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:37,367 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:37,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:26:37,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 11:26:37,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 11:26:37,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:37,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:37,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:26:37,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:26:37,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:26:37,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:37,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950427132] [2025-03-04 11:26:37,839 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:26:37,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049328730] [2025-03-04 11:26:37,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049328730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:37,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:26:37,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 11:26:37,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117787064] [2025-03-04 11:26:37,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:37,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:26:37,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:37,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:26:37,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:26:37,841 INFO L87 Difference]: Start difference. First operand 343 states and 383 transitions. Second operand has 12 states, 11 states have (on average 24.0) internal successors, (264), 12 states have internal predecessors, (264), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-04 11:26:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:38,153 INFO L93 Difference]: Finished difference Result 349 states and 388 transitions. [2025-03-04 11:26:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:26:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 24.0) internal successors, (264), 12 states have internal predecessors, (264), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 202 [2025-03-04 11:26:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:38,155 INFO L225 Difference]: With dead ends: 349 [2025-03-04 11:26:38,155 INFO L226 Difference]: Without dead ends: 348 [2025-03-04 11:26:38,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:26:38,156 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 98 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:38,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 619 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-04 11:26:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2025-03-04 11:26:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 309 states have (on average 1.029126213592233) internal successors, (318), 312 states have internal predecessors, (318), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 11:26:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 382 transitions. [2025-03-04 11:26:38,171 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 382 transitions. Word has length 202 [2025-03-04 11:26:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:38,171 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 382 transitions. [2025-03-04 11:26:38,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 24.0) internal successors, (264), 12 states have internal predecessors, (264), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-04 11:26:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 382 transitions. [2025-03-04 11:26:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-04 11:26:38,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:38,174 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1] [2025-03-04 11:26:38,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:26:38,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:38,375 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:38,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:38,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1297543667, now seen corresponding path program 2 times [2025-03-04 11:26:38,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:38,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-03-04 11:26:38,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:38,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:38,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 312 statements into 2 equivalence classes. [2025-03-04 11:26:38,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 11:26:38,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:38,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-03-04 11:26:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-03-04 11:26:38,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122822815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185362279] [2025-03-04 11:26:38,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:38,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:38,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:38,521 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-04 11:26:38,523 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-04 11:26:38,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 312 statements into 2 equivalence classes. [2025-03-04 11:26:38,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 11:26:38,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:38,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:38,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:26:38,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-03-04 11:26:38,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-03-04 11:26:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185362279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:39,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 11:26:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973382743] [2025-03-04 11:26:39,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:39,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:26:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:39,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:26:39,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:26:39,051 INFO L87 Difference]: Start difference. First operand 346 states and 382 transitions. Second operand has 13 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:26:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:39,126 INFO L93 Difference]: Finished difference Result 346 states and 382 transitions. [2025-03-04 11:26:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:26:39,127 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 312 [2025-03-04 11:26:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:39,128 INFO L225 Difference]: With dead ends: 346 [2025-03-04 11:26:39,128 INFO L226 Difference]: Without dead ends: 345 [2025-03-04 11:26:39,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:26:39,129 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 187 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:39,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 72 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:26:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-04 11:26:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-04 11:26:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 309 states have (on average 1.0161812297734627) internal successors, (314), 311 states have internal predecessors, (314), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 11:26:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 378 transitions. [2025-03-04 11:26:39,140 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 378 transitions. Word has length 312 [2025-03-04 11:26:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:39,141 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 378 transitions. [2025-03-04 11:26:39,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:26:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 378 transitions. [2025-03-04 11:26:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-04 11:26:39,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:39,143 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-03-04 11:26:39,149 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-04 11:26:39,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-04 11:26:39,344 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:39,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:39,344 INFO L85 PathProgramCache]: Analyzing trace with hash -736636121, now seen corresponding path program 3 times [2025-03-04 11:26:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:39,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368583746] [2025-03-04 11:26:39,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:26:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:39,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 336 statements into 13 equivalence classes. [2025-03-04 11:26:39,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 121 of 336 statements. [2025-03-04 11:26:39,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 11:26:39,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 301 proven. 164 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-03-04 11:26:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:39,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368583746] [2025-03-04 11:26:39,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368583746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:39,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216570504] [2025-03-04 11:26:39,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:26:39,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:39,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:39,680 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-04 11:26:39,681 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-04 11:26:39,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 336 statements into 13 equivalence classes. [2025-03-04 11:26:39,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 336 statements. [2025-03-04 11:26:39,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 11:26:39,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:39,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:26:39,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 126 proven. 148 refuted. 0 times theorem prover too weak. 1522 trivial. 0 not checked. [2025-03-04 11:26:40,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216570504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:40,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:26:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-03-04 11:26:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839801308] [2025-03-04 11:26:40,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:40,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:26:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:40,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:26:40,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:26:40,713 INFO L87 Difference]: Start difference. First operand 345 states and 378 transitions. Second operand has 19 states, 18 states have (on average 7.888888888888889) internal successors, (142), 19 states have internal predecessors, (142), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:26:41,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:41,148 INFO L93 Difference]: Finished difference Result 345 states and 378 transitions. [2025-03-04 11:26:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:26:41,148 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 7.888888888888889) internal successors, (142), 19 states have internal predecessors, (142), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 336 [2025-03-04 11:26:41,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:41,150 INFO L225 Difference]: With dead ends: 345 [2025-03-04 11:26:41,150 INFO L226 Difference]: Without dead ends: 344 [2025-03-04 11:26:41,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:26:41,151 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 294 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:41,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 57 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-04 11:26:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-03-04 11:26:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 309 states have (on average 1.006472491909385) internal successors, (311), 310 states have internal predecessors, (311), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 11:26:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 375 transitions. [2025-03-04 11:26:41,175 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 375 transitions. Word has length 336 [2025-03-04 11:26:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:41,175 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 375 transitions. [2025-03-04 11:26:41,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 7.888888888888889) internal successors, (142), 19 states have internal predecessors, (142), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:26:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 375 transitions. [2025-03-04 11:26:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-04 11:26:41,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:41,184 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 11:26:41,189 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-04 11:26:41,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:41,384 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 11:26:41,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1280151138, now seen corresponding path program 3 times [2025-03-04 11:26:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:41,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523307420] [2025-03-04 11:26:41,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:26:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:41,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 459 statements into 16 equivalence classes. [2025-03-04 11:26:41,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 442 of 459 statements. [2025-03-04 11:26:41,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 11:26:41,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 150 proven. 1490 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-04 11:26:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523307420] [2025-03-04 11:26:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523307420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180250949] [2025-03-04 11:26:42,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:26:42,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:42,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:42,770 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-04 11:26:42,771 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-04 11:26:42,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 459 statements into 16 equivalence classes. [2025-03-04 11:26:42,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 68 of 459 statements. [2025-03-04 11:26:42,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:26:42,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:42,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:26:42,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 228 proven. 164 refuted. 0 times theorem prover too weak. 3018 trivial. 0 not checked. [2025-03-04 11:26:43,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:48,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180250949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:48,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:26:48,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 10] total 42 [2025-03-04 11:26:48,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848735299] [2025-03-04 11:26:48,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:48,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 11:26:48,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:48,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 11:26:48,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2275, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:26:48,511 INFO L87 Difference]: Start difference. First operand 344 states and 375 transitions. Second operand has 42 states, 42 states have (on average 8.666666666666666) internal successors, (364), 41 states have internal predecessors, (364), 14 states have call successors, (36), 1 states have call predecessors, (36), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2025-03-04 11:26:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:57,146 INFO L93 Difference]: Finished difference Result 350 states and 380 transitions. [2025-03-04 11:26:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-04 11:26:57,147 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 8.666666666666666) internal successors, (364), 41 states have internal predecessors, (364), 14 states have call successors, (36), 1 states have call predecessors, (36), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) Word has length 459 [2025-03-04 11:26:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:57,147 INFO L225 Difference]: With dead ends: 350 [2025-03-04 11:26:57,148 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:26:57,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2275 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2031, Invalid=8681, Unknown=0, NotChecked=0, Total=10712 [2025-03-04 11:26:57,153 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 351 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 6421 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 6489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 6421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:57,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 877 Invalid, 6489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 6421 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 11:26:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:26:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:26:57,154 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-04 11:26:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:26:57,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 459 [2025-03-04 11:26:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:57,154 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:26:57,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 8.666666666666666) internal successors, (364), 41 states have internal predecessors, (364), 14 states have call successors, (36), 1 states have call predecessors, (36), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2025-03-04 11:26:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:26:57,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:26:57,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2025-03-04 11:26:57,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2025-03-04 11:26:57,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2025-03-04 11:26:57,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2025-03-04 11:26:57,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2025-03-04 11:26:57,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2025-03-04 11:26:57,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2025-03-04 11:26:57,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2025-03-04 11:26:57,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2025-03-04 11:26:57,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2025-03-04 11:26:57,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2025-03-04 11:26:57,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2025-03-04 11:26:57,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2025-03-04 11:26:57,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2025-03-04 11:26:57,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2025-03-04 11:26:57,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2025-03-04 11:26:57,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2025-03-04 11:26:57,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2025-03-04 11:26:57,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2025-03-04 11:26:57,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2025-03-04 11:26:57,170 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-04 11:26:57,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:57,366 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:57,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:26:58,960 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:26:58,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:26:58 BoogieIcfgContainer [2025-03-04 11:26:58,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:26:58,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:26:58,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:26:58,973 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:26:58,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:26:27" (3/4) ... [2025-03-04 11:26:58,975 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:26:58,981 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:26:58,984 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 11:26:58,984 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:26:58,985 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:26:58,985 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:26:59,046 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:26:59,046 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:26:59,046 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:26:59,048 INFO L158 Benchmark]: Toolchain (without parser) took 31828.26ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 112.9MB in the beginning and 401.2MB in the end (delta: -288.3MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2025-03-04 11:26:59,048 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:26:59,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.38ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:26:59,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.02ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:26:59,049 INFO L158 Benchmark]: Boogie Preprocessor took 18.50ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.3MB in the end (delta: 773.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:26:59,050 INFO L158 Benchmark]: IcfgBuilder took 319.10ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 80.1MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:26:59,050 INFO L158 Benchmark]: TraceAbstraction took 31225.51ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 79.6MB in the beginning and 405.5MB in the end (delta: -325.9MB). Peak memory consumption was 274.7MB. Max. memory is 16.1GB. [2025-03-04 11:26:59,050 INFO L158 Benchmark]: Witness Printer took 73.37ms. Allocated memory is still 520.1MB. Free memory was 405.5MB in the beginning and 401.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:26:59,051 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.18ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.38ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.02ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.50ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.3MB in the end (delta: 773.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 319.10ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 80.1MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31225.51ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 79.6MB in the beginning and 405.5MB in the end (delta: -325.9MB). Peak memory consumption was 274.7MB. Max. memory is 16.1GB. * Witness Printer took 73.37ms. Allocated memory is still 520.1MB. Free memory was 405.5MB in the beginning and 401.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. 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: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: 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: 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: 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: 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: 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: 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: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: 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, 121 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 22, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2512 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2453 mSDsluCounter, 5400 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3816 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9871 IncrementalHoareTripleChecker+Invalid, 10218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 1584 mSDtfsCounter, 9871 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3853 GetRequests, 3572 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2957 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=19, InterpolantAutomatonStates: 201, 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, 341 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 4746 NumberOfCodeBlocks, 3831 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 5479 ConstructedInterpolants, 4 QuantifiedInterpolants, 25089 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2652 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 42 InterpolantComputations, 10 PerfectInterpolantSequences, 15813/19815 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 50 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: ((((((((((((s <= 16) && (8 <= s)) && (7 == t)) && (3 == a)) && (0 <= n)) && (n <= ((__int128) s + 4))) || (((((((((((((((__int128) t * t) + ((__int128) 2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) : ((((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) + 4)) == 0) && (s <= ((__int128) t + 20))) && (n <= 20)) && (((__int128) t + 1) <= s)) && (3 <= t)) && ((((__int128) a * a) + ((__int128) 2 * a)) <= 9223372036854775806)) && (((((((__int128) t * t) + ((__int128) -2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) : ((((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) - 1)) <= 20)) && (0 <= n)) && (((n + ((__int128) 7 * t)) + 65) <= (s + ((__int128) a * 18))))) || ((((((5 == t) && (n <= ((__int128) s + 11))) && (2 == a)) && (6 <= s)) && (0 <= n)) && (s <= 9))) || (((((n <= 20) && (t == 1)) && (a == 0)) && (0 <= n)) && (s == 1))) || (((((((((((((((__int128) t * t) + ((__int128) 2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) : ((((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) + 4)) == 0) && (((51 + ((__int128) 5 * t)) + n) <= (s + ((__int128) a * 18)))) && (s <= ((__int128) t + 20))) && (n <= 20)) && (((__int128) t + 1) <= s)) && (3 <= t)) && (((((((__int128) t * t) + ((__int128) -2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) : ((((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) - 1)) <= 20)) && (0 <= n)) && ((((__int128) a * 10) + ((__int128) a * a)) <= 9223372036854775782))) || (((((3 == t) && (n <= 20)) && (a == 1)) && (s == 4)) && (0 <= n))) || (((((((((long long) 5 + n) <= s) && (10 <= s)) && (9 == t)) && (n <= 20)) && (s <= 29)) && (0 <= n)) && (a == 4))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:26:59,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE