./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.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_unwindbound10.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 4615816b63186e8ef25ffa56a09fb574b90534edb7a787dbb36e36eb2c34dee2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:25:41,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:25:41,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:25:41,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:25:41,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:25:41,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:25:41,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:25:41,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:25:41,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:25:41,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:25:41,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:25:41,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:25:41,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:25:41,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:25:41,725 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:25:41,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:25:41,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:25:41,726 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:25:41,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:25:41,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:25:41,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:25:41,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:25:41,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:25:41,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:25:41,726 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:25:41,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:25:41,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:25:41,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:25:41,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:25:41,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:25:41,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:25:41,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:25:41,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:25:41,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:25:41,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:25:41,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:25:41,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:25:41,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:25:41,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:25:41,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:25:41,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:25:41,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:25:41,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:25:41,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:25:41,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:25:41,729 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 -> 4615816b63186e8ef25ffa56a09fb574b90534edb7a787dbb36e36eb2c34dee2 [2025-03-04 11:25:41,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:25:41,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:25:41,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:25:41,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:25:41,944 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:25:41,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2025-03-04 11:25:43,050 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc315c459/a8b8643dc06f4920bd745abecf95c98e/FLAG5db180455 [2025-03-04 11:25:43,242 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:25:43,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2025-03-04 11:25:43,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc315c459/a8b8643dc06f4920bd745abecf95c98e/FLAG5db180455 [2025-03-04 11:25:43,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc315c459/a8b8643dc06f4920bd745abecf95c98e [2025-03-04 11:25:43,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:25:43,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:25:43,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:25:43,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:25:43,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:25:43,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3995b8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43, skipping insertion in model container [2025-03-04 11:25:43,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:25:43,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:25:43,420 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:25:43,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:25:43,444 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:25:43,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43 WrapperNode [2025-03-04 11:25:43,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:25:43,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:25:43,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:25:43,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:25:43,450 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:25:43" (1/1) ... [2025-03-04 11:25:43,454 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:25:43" (1/1) ... [2025-03-04 11:25:43,469 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-03-04 11:25:43,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:25:43,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:25:43,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:25:43,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:25:43,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,492 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:25:43,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:25:43,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:25:43,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:25:43,500 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:25:43,504 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (1/1) ... [2025-03-04 11:25:43,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:25:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:43,526 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:25:43,528 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:25:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:25:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:25:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:25:43,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:25:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:25:43,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:25:43,584 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:25:43,585 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:25:43,859 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-04 11:25:43,859 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:25:43,871 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:25:43,872 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:25:43,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:25:43 BoogieIcfgContainer [2025-03-04 11:25:43,873 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:25:43,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:25:43,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:25:43,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:25:43,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:25:43" (1/3) ... [2025-03-04 11:25:43,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587642c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:25:43, skipping insertion in model container [2025-03-04 11:25:43,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:43" (2/3) ... [2025-03-04 11:25:43,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587642c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:25:43, skipping insertion in model container [2025-03-04 11:25:43,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:25:43" (3/3) ... [2025-03-04 11:25:43,880 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound10.c [2025-03-04 11:25:43,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:25:43,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt1-ll_unwindbound10.c that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 52 error locations. [2025-03-04 11:25:43,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:25:43,952 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;@660bd38d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:25:43,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-04 11:25:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 117 states have internal predecessors, (121), 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:25:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 11:25:43,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:43,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 11:25:43,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash 4616543, now seen corresponding path program 1 times [2025-03-04 11:25:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:43,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816544313] [2025-03-04 11:25:43,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:44,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 11:25:44,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 11:25:44,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:44,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:44,104 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:25:44,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:44,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816544313] [2025-03-04 11:25:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816544313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:44,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:44,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:25:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603711226] [2025-03-04 11:25:44,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:44,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:25:44,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:44,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:25:44,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:44,125 INFO L87 Difference]: Start difference. First operand has 125 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 117 states have internal predecessors, (121), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:25:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:44,195 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2025-03-04 11:25:44,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:25:44,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 11:25:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:44,201 INFO L225 Difference]: With dead ends: 247 [2025-03-04 11:25:44,201 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 11:25:44,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:25:44,205 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 4 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:44,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 360 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:25:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 11:25:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 11:25:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 64 states have (on average 1.765625) internal successors, (113), 111 states have internal predecessors, (113), 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:25:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2025-03-04 11:25:44,236 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 4 [2025-03-04 11:25:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:44,236 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2025-03-04 11:25:44,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:25:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2025-03-04 11:25:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:25:44,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:44,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:44,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:25:44,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:44,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 92561394, now seen corresponding path program 1 times [2025-03-04 11:25:44,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:44,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351375554] [2025-03-04 11:25:44,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:44,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:44,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:25:44,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:25:44,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:44,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:44,276 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:25:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351375554] [2025-03-04 11:25:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351375554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:44,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:44,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:25:44,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225584509] [2025-03-04 11:25:44,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:44,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:25:44,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:44,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:25:44,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:25:44,278 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:25:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:44,411 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2025-03-04 11:25:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:25:44,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:25:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:44,413 INFO L225 Difference]: With dead ends: 212 [2025-03-04 11:25:44,413 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 11:25:44,413 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:25:44,414 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 68 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:44,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 173 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 11:25:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2025-03-04 11:25:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.6161616161616161) internal successors, (160), 146 states have internal predecessors, (160), 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:25:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2025-03-04 11:25:44,426 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 7 [2025-03-04 11:25:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:44,426 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2025-03-04 11:25:44,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:25:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2025-03-04 11:25:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:25:44,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:44,427 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] [2025-03-04 11:25:44,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:25:44,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:44,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash 265858617, now seen corresponding path program 1 times [2025-03-04 11:25:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679116805] [2025-03-04 11:25:44,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:44,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:25:44,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:25:44,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:44,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:25:44,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777516722] [2025-03-04 11:25:44,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:44,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:44,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:44,457 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:25:44,459 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:25:44,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:25:44,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:25:44,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:44,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:44,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:25:44,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:44,568 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:25:44,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:25:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679116805] [2025-03-04 11:25:44,569 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777516722] [2025-03-04 11:25:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777516722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:44,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:44,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:25:44,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568411895] [2025-03-04 11:25:44,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:44,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:25:44,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:44,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:25:44,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:25:44,571 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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:25:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:44,665 INFO L93 Difference]: Finished difference Result 184 states and 206 transitions. [2025-03-04 11:25:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:25:44,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2025-03-04 11:25:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:44,666 INFO L225 Difference]: With dead ends: 184 [2025-03-04 11:25:44,666 INFO L226 Difference]: Without dead ends: 176 [2025-03-04 11:25:44,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:25:44,669 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:44,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 179 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-04 11:25:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2025-03-04 11:25:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 109 states have (on average 1.5688073394495412) internal successors, (171), 156 states have internal predecessors, (171), 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:25:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 191 transitions. [2025-03-04 11:25:44,684 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 191 transitions. Word has length 28 [2025-03-04 11:25:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:44,685 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 191 transitions. [2025-03-04 11:25:44,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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:25:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 191 transitions. [2025-03-04 11:25:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:25:44,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:44,685 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] [2025-03-04 11:25:44,692 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:25:44,886 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:25:44,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:44,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash -348317412, now seen corresponding path program 1 times [2025-03-04 11:25:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:44,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734953808] [2025-03-04 11:25:44,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:44,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:25:44,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:25:44,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:44,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:44,967 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:25:44,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:44,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734953808] [2025-03-04 11:25:44,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734953808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:44,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:44,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:25:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779154621] [2025-03-04 11:25:44,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:44,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:25:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:44,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:25:44,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:25:44,970 INFO L87 Difference]: Start difference. First operand 168 states and 191 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:25:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:45,050 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2025-03-04 11:25:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:25:45,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 29 [2025-03-04 11:25:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:45,051 INFO L225 Difference]: With dead ends: 184 [2025-03-04 11:25:45,051 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 11:25:45,051 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:25:45,052 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:45,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 173 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 11:25:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-03-04 11:25:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 112 states have (on average 1.4910714285714286) internal successors, (167), 159 states have internal predecessors, (167), 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:25:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2025-03-04 11:25:45,064 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 29 [2025-03-04 11:25:45,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:45,065 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2025-03-04 11:25:45,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:25:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2025-03-04 11:25:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:25:45,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:45,065 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] [2025-03-04 11:25:45,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:25:45,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:45,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash -82983179, now seen corresponding path program 1 times [2025-03-04 11:25:45,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:45,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684052474] [2025-03-04 11:25:45,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:45,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:25:45,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:25:45,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:45,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:45,160 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:25:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684052474] [2025-03-04 11:25:45,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684052474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:45,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:45,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:25:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487328488] [2025-03-04 11:25:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:45,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:25:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:45,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:25:45,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:45,162 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:25:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:45,258 INFO L93 Difference]: Finished difference Result 176 states and 192 transitions. [2025-03-04 11:25:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:25:45,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 32 [2025-03-04 11:25:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:45,259 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:25:45,259 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 11:25:45,260 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:25:45,260 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:45,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 179 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 11:25:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-03-04 11:25:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 159 states have internal predecessors, (165), 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:25:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2025-03-04 11:25:45,275 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 32 [2025-03-04 11:25:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:45,275 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2025-03-04 11:25:45,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:25:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2025-03-04 11:25:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:25:45,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:45,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:45,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:25:45,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1605607503, now seen corresponding path program 1 times [2025-03-04 11:25:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866907378] [2025-03-04 11:25:45,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:45,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:45,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:25:45,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:25:45,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:45,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:45,344 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:25:45,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:45,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866907378] [2025-03-04 11:25:45,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866907378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:45,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:45,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:25:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069140250] [2025-03-04 11:25:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:45,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:25:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:45,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:25:45,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:25:45,345 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:25:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:45,427 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2025-03-04 11:25:45,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:25:45,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 36 [2025-03-04 11:25:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:45,428 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:25:45,428 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 11:25:45,429 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:25:45,430 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 29 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:45,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 155 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 11:25:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-04 11:25:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 138 states have internal predecessors, (140), 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:25:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2025-03-04 11:25:45,442 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 36 [2025-03-04 11:25:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:45,443 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2025-03-04 11:25:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:25:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2025-03-04 11:25:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 11:25:45,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:45,443 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:25:45,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:25:45,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:45,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1607185735, now seen corresponding path program 1 times [2025-03-04 11:25:45,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:45,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833886276] [2025-03-04 11:25:45,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:45,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:45,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:25:45,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:25:45,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:45,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:45,530 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:25:45,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:45,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833886276] [2025-03-04 11:25:45,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833886276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:45,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:45,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:25:45,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281139472] [2025-03-04 11:25:45,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:45,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:25:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:45,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:25:45,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:45,532 INFO L87 Difference]: Start difference. First operand 148 states and 156 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:25:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:45,642 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2025-03-04 11:25:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:25:45,642 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:25:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:45,643 INFO L225 Difference]: With dead ends: 151 [2025-03-04 11:25:45,643 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 11:25:45,643 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:25:45,643 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:45,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 224 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 11:25:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2025-03-04 11:25:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 139 states have internal predecessors, (141), 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:25:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2025-03-04 11:25:45,647 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 49 [2025-03-04 11:25:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:45,647 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2025-03-04 11:25:45,648 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:25:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2025-03-04 11:25:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:25:45,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:45,649 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, 1] [2025-03-04 11:25:45,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:25:45,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:45,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1716849787, now seen corresponding path program 1 times [2025-03-04 11:25:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:45,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170908290] [2025-03-04 11:25:45,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:45,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:25:45,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:25:45,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:45,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:45,729 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:25:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170908290] [2025-03-04 11:25:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170908290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:45,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:45,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:25:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643446248] [2025-03-04 11:25:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:45,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:25:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:45,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:25:45,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:45,730 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (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:25:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:45,833 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2025-03-04 11:25:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:25:45,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (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 50 [2025-03-04 11:25:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:45,835 INFO L225 Difference]: With dead ends: 151 [2025-03-04 11:25:45,835 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 11:25:45,835 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:25:45,835 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:45,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 11:25:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-04 11:25:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 140 states have internal predecessors, (142), 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:25:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2025-03-04 11:25:45,840 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 50 [2025-03-04 11:25:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:45,840 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2025-03-04 11:25:45,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (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:25:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2025-03-04 11:25:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:25:45,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:45,841 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, 1, 1] [2025-03-04 11:25:45,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:25:45,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:45,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash 625206425, now seen corresponding path program 1 times [2025-03-04 11:25:45,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:45,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651193151] [2025-03-04 11:25:45,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:45,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:45,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:25:45,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:25:45,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:45,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:45,944 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:25:45,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:45,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651193151] [2025-03-04 11:25:45,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651193151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:45,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214084481] [2025-03-04 11:25:45,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:45,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:45,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:45,947 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:25:45,948 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:25:45,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:25:45,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:25:45,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:45,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:45,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:25:45,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:25:46,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:25:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214084481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:46,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:25:46,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:25:46,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214429517] [2025-03-04 11:25:46,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:46,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:25:46,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:46,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:25:46,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:25:46,089 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 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:25:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:46,109 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2025-03-04 11:25:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:25:46,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 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 52 [2025-03-04 11:25:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:46,111 INFO L225 Difference]: With dead ends: 150 [2025-03-04 11:25:46,111 INFO L226 Difference]: Without dead ends: 149 [2025-03-04 11:25:46,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:25:46,112 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 80 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:46,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:25:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-04 11:25:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-04 11:25:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 139 states have internal predecessors, (141), 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:25:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2025-03-04 11:25:46,120 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 52 [2025-03-04 11:25:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:46,120 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2025-03-04 11:25:46,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 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:25:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2025-03-04 11:25:46,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 11:25:46,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:46,121 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:46,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:25:46,321 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:25:46,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:46,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2093437222, now seen corresponding path program 1 times [2025-03-04 11:25:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:46,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377031544] [2025-03-04 11:25:46,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:46,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:25:46,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:25:46,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:46,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:25:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:46,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377031544] [2025-03-04 11:25:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377031544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:46,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850983860] [2025-03-04 11:25:46,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:46,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:46,399 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:25:46,401 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:25:46,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:25:46,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:25:46,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:46,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:46,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:25:46,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:25:46,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:25:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850983860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:46,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:25:46,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:25:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850867910] [2025-03-04 11:25:46,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:46,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:25:46,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:46,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:25:46,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:25:46,522 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 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:25:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:46,568 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2025-03-04 11:25:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:25:46,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 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 53 [2025-03-04 11:25:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:46,571 INFO L225 Difference]: With dead ends: 197 [2025-03-04 11:25:46,571 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 11:25:46,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:25:46,571 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 77 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:46,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 506 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:25:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 11:25:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 164. [2025-03-04 11:25:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.528301886792453) internal successors, (162), 152 states have internal predecessors, (162), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:25:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 182 transitions. [2025-03-04 11:25:46,580 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 182 transitions. Word has length 53 [2025-03-04 11:25:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:46,580 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 182 transitions. [2025-03-04 11:25:46,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 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:25:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 182 transitions. [2025-03-04 11:25:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:25:46,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:46,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:46,588 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:25:46,781 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:25:46,782 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:46,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:46,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1748473254, now seen corresponding path program 1 times [2025-03-04 11:25:46,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:46,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834321458] [2025-03-04 11:25:46,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:46,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:25:46,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:25:46,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:46,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:25:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:46,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834321458] [2025-03-04 11:25:46,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834321458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:46,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756395253] [2025-03-04 11:25:46,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:46,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:46,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:46,828 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:25:46,829 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:25:46,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:25:46,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:25:46,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:46,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:46,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:25:46,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:25:46,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:25:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756395253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:46,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:25:46,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:25:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575267571] [2025-03-04 11:25:46,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:46,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:25:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:46,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:25:46,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:25:46,911 INFO L87 Difference]: Start difference. First operand 164 states and 182 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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:25:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:46,980 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2025-03-04 11:25:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:25:46,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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 55 [2025-03-04 11:25:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:46,981 INFO L225 Difference]: With dead ends: 164 [2025-03-04 11:25:46,981 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 11:25:46,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:25:46,982 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 73 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:46,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 139 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:46,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 11:25:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-03-04 11:25:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.4056603773584906) internal successors, (149), 143 states have internal predecessors, (149), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:25:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2025-03-04 11:25:46,986 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 55 [2025-03-04 11:25:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:46,987 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2025-03-04 11:25:46,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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:25:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2025-03-04 11:25:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:25:46,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:46,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:46,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:25:47,187 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:25:47,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:47,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1631903990, now seen corresponding path program 1 times [2025-03-04 11:25:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936740382] [2025-03-04 11:25:47,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:47,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:25:47,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:25:47,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:25:47,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:47,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936740382] [2025-03-04 11:25:47,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936740382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:47,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810201119] [2025-03-04 11:25:47,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:47,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:47,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:47,247 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:25:47,249 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:25:47,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:25:47,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:25:47,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:47,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:47,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:25:47,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:25:47,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:25:47,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810201119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:47,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:25:47,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:25:47,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078716756] [2025-03-04 11:25:47,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:47,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:25:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:47,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:25:47,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:25:47,410 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 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:25:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:47,521 INFO L93 Difference]: Finished difference Result 279 states and 330 transitions. [2025-03-04 11:25:47,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:25:47,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 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 56 [2025-03-04 11:25:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:47,523 INFO L225 Difference]: With dead ends: 279 [2025-03-04 11:25:47,524 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 11:25:47,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 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:25:47,524 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 186 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:47,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 235 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 11:25:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 146. [2025-03-04 11:25:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 134 states have internal predecessors, (136), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:25:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2025-03-04 11:25:47,533 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 56 [2025-03-04 11:25:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:47,534 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2025-03-04 11:25:47,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 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:25:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2025-03-04 11:25:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 11:25:47,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:47,536 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:47,542 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:25:47,737 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:25:47,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:47,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash -116901071, now seen corresponding path program 1 times [2025-03-04 11:25:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056069978] [2025-03-04 11:25:47,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:47,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:25:47,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:25:47,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:47,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:25:47,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:47,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056069978] [2025-03-04 11:25:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056069978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:47,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187500121] [2025-03-04 11:25:47,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:47,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:47,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:47,805 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:25:47,807 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:25:47,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:25:47,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:25:47,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:47,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:47,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:25:47,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:25:47,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:25:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187500121] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:47,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:25:47,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2025-03-04 11:25:47,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281239758] [2025-03-04 11:25:47,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:47,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:25:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:47,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:25:47,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:25:47,972 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 11:25:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:48,085 INFO L93 Difference]: Finished difference Result 378 states and 398 transitions. [2025-03-04 11:25:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:25:48,085 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 69 [2025-03-04 11:25:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:48,087 INFO L225 Difference]: With dead ends: 378 [2025-03-04 11:25:48,087 INFO L226 Difference]: Without dead ends: 338 [2025-03-04 11:25:48,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:25:48,087 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 222 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:48,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 796 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-04 11:25:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 258. [2025-03-04 11:25:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 205 states have (on average 1.3219512195121952) internal successors, (271), 235 states have internal predecessors, (271), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:25:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 311 transitions. [2025-03-04 11:25:48,097 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 311 transitions. Word has length 69 [2025-03-04 11:25:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:48,097 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 311 transitions. [2025-03-04 11:25:48,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 11:25:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 311 transitions. [2025-03-04 11:25:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 11:25:48,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:48,098 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2025-03-04 11:25:48,103 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:25:48,302 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:25:48,302 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:48,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash 594944254, now seen corresponding path program 1 times [2025-03-04 11:25:48,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877686924] [2025-03-04 11:25:48,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:48,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:48,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:25:48,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:25:48,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:48,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:25:48,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264185272] [2025-03-04 11:25:48,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:48,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:48,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:48,314 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:25:48,315 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:25:48,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:25:48,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:25:48,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:48,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:48,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:25:48,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:25:48,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:25:48,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:48,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877686924] [2025-03-04 11:25:48,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:48,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264185272] [2025-03-04 11:25:48,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264185272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:48,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:25:48,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 11:25:48,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930880760] [2025-03-04 11:25:48,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:48,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:25:48,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:48,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:25:48,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:25:48,508 INFO L87 Difference]: Start difference. First operand 258 states and 311 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 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:25:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:48,673 INFO L93 Difference]: Finished difference Result 347 states and 368 transitions. [2025-03-04 11:25:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:25:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 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 69 [2025-03-04 11:25:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:48,675 INFO L225 Difference]: With dead ends: 347 [2025-03-04 11:25:48,675 INFO L226 Difference]: Without dead ends: 345 [2025-03-04 11:25:48,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 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:25:48,676 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 339 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:48,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 318 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-04 11:25:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 269. [2025-03-04 11:25:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 215 states have (on average 1.283720930232558) internal successors, (276), 245 states have internal predecessors, (276), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 11:25:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 318 transitions. [2025-03-04 11:25:48,686 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 318 transitions. Word has length 69 [2025-03-04 11:25:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:48,686 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 318 transitions. [2025-03-04 11:25:48,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 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:25:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 318 transitions. [2025-03-04 11:25:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 11:25:48,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:48,687 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, 1, 1] [2025-03-04 11:25:48,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:25:48,887 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:25:48,887 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:48,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash -211905677, now seen corresponding path program 1 times [2025-03-04 11:25:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:48,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555608140] [2025-03-04 11:25:48,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:48,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 11:25:48,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 11:25:48,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:48,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:25:48,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297908794] [2025-03-04 11:25:48,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:48,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:48,902 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:25:48,904 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:25:48,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 11:25:48,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 11:25:48,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:48,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:25:48,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:48,992 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:25:48,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:49,093 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:25:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:49,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555608140] [2025-03-04 11:25:49,093 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:49,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297908794] [2025-03-04 11:25:49,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297908794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:49,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:25:49,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 11:25:49,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657071159] [2025-03-04 11:25:49,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:49,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:25:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:49,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:25:49,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:25:49,095 INFO L87 Difference]: Start difference. First operand 269 states and 318 transitions. Second operand has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 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:25:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:49,273 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2025-03-04 11:25:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:25:49,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 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 76 [2025-03-04 11:25:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:49,275 INFO L225 Difference]: With dead ends: 308 [2025-03-04 11:25:49,276 INFO L226 Difference]: Without dead ends: 300 [2025-03-04 11:25:49,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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:25:49,277 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 150 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:49,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 285 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:25:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-04 11:25:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 268. [2025-03-04 11:25:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 219 states have (on average 1.2054794520547945) internal successors, (264), 242 states have internal predecessors, (264), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:25:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2025-03-04 11:25:49,289 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 76 [2025-03-04 11:25:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:49,289 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2025-03-04 11:25:49,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 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:25:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2025-03-04 11:25:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 11:25:49,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:49,290 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:49,296 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:25:49,494 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:25:49,494 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:49,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2020858658, now seen corresponding path program 1 times [2025-03-04 11:25:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817834162] [2025-03-04 11:25:49,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:49,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:25:49,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:25:49,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:49,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:25:49,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:49,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817834162] [2025-03-04 11:25:49,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817834162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:49,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137441781] [2025-03-04 11:25:49,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:49,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:49,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:49,561 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:25:49,568 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:25:49,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:25:49,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:25:49,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:49,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:49,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:25:49,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:25:49,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:25:49,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137441781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:49,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:25:49,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 11:25:49,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500958455] [2025-03-04 11:25:49,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:49,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:25:49,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:49,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:25:49,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:25:49,821 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 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:25:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:49,956 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2025-03-04 11:25:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:25:49,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 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 77 [2025-03-04 11:25:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:49,958 INFO L225 Difference]: With dead ends: 268 [2025-03-04 11:25:49,958 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 11:25:49,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 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:25:49,958 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 150 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:49,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 196 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 11:25:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-04 11:25:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 219 states have (on average 1.17351598173516) internal successors, (257), 239 states have internal predecessors, (257), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:25:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 301 transitions. [2025-03-04 11:25:49,971 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 301 transitions. Word has length 77 [2025-03-04 11:25:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:49,971 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 301 transitions. [2025-03-04 11:25:49,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 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:25:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 301 transitions. [2025-03-04 11:25:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 11:25:49,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:49,972 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, 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:25:49,978 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:25:50,177 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:25:50,177 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:50,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1777890991, now seen corresponding path program 1 times [2025-03-04 11:25:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:50,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492603567] [2025-03-04 11:25:50,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:50,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 11:25:50,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:25:50,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:50,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:25:50,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:50,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492603567] [2025-03-04 11:25:50,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492603567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:50,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686575008] [2025-03-04 11:25:50,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:50,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:50,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:50,240 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:25:50,242 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:25:50,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 11:25:50,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:25:50,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:50,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:50,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:25:50,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:25:50,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:25:50,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686575008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:50,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:25:50,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 11:25:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729881965] [2025-03-04 11:25:50,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:50,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:25:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:50,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:25:50,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:25:50,491 INFO L87 Difference]: Start difference. First operand 265 states and 301 transitions. Second operand has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 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:25:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:50,678 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2025-03-04 11:25:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:25:50,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 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 78 [2025-03-04 11:25:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:50,679 INFO L225 Difference]: With dead ends: 282 [2025-03-04 11:25:50,680 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 11:25:50,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 150 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:25:50,680 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 118 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:50,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 260 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:25:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 11:25:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 261. [2025-03-04 11:25:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 221 states have (on average 1.1040723981900453) internal successors, (244), 235 states have internal predecessors, (244), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:25:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 288 transitions. [2025-03-04 11:25:50,695 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 288 transitions. Word has length 78 [2025-03-04 11:25:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:50,695 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 288 transitions. [2025-03-04 11:25:50,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 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:25:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 288 transitions. [2025-03-04 11:25:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:25:50,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:50,696 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:50,702 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:25:50,896 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:25:50,897 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:50,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 843743023, now seen corresponding path program 1 times [2025-03-04 11:25:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:50,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929069369] [2025-03-04 11:25:50,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:50,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:25:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:25:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:50,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:25:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929069369] [2025-03-04 11:25:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929069369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190266191] [2025-03-04 11:25:50,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:50,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:50,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:50,976 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:25:50,978 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:25:50,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:25:51,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:25:51,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:51,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:51,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:25:51,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:25:51,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:25:51,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190266191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:51,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:25:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:25:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578624953] [2025-03-04 11:25:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:51,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:25:51,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:51,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:25:51,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:25:51,186 INFO L87 Difference]: Start difference. First operand 261 states and 288 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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:25:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:51,289 INFO L93 Difference]: Finished difference Result 261 states and 288 transitions. [2025-03-04 11:25:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:25:51,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 80 [2025-03-04 11:25:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:51,290 INFO L225 Difference]: With dead ends: 261 [2025-03-04 11:25:51,290 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 11:25:51,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 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:25:51,291 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 61 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:51,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 165 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 11:25:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-04 11:25:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 179 states have (on average 1.0446927374301676) internal successors, (187), 185 states have internal predecessors, (187), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 11:25:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 219 transitions. [2025-03-04 11:25:51,304 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 219 transitions. Word has length 80 [2025-03-04 11:25:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:51,304 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 219 transitions. [2025-03-04 11:25:51,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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:25:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 219 transitions. [2025-03-04 11:25:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 11:25:51,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:51,306 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, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-04 11:25:51,312 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:25:51,511 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:25:51,511 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:51,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:51,511 INFO L85 PathProgramCache]: Analyzing trace with hash 678603759, now seen corresponding path program 1 times [2025-03-04 11:25:51,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:51,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988458950] [2025-03-04 11:25:51,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:51,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 11:25:51,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 11:25:51,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:51,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:25:51,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:51,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988458950] [2025-03-04 11:25:51,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988458950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:51,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175695585] [2025-03-04 11:25:51,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:51,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:51,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:51,670 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:25:51,671 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:25:51,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 11:25:51,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 11:25:51,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:51,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:51,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:25:51,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:25:52,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:25:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175695585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:52,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:25:52,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 11:25:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016055918] [2025-03-04 11:25:52,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:52,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:25:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:52,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:25:52,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:25:52,248 INFO L87 Difference]: Start difference. First operand 207 states and 219 transitions. Second operand has 20 states, 19 states have (on average 16.0) internal successors, (304), 20 states have internal predecessors, (304), 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:25:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:52,564 INFO L93 Difference]: Finished difference Result 334 states and 368 transitions. [2025-03-04 11:25:52,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:25:52,565 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 16.0) internal successors, (304), 20 states have internal predecessors, (304), 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 146 [2025-03-04 11:25:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:52,566 INFO L225 Difference]: With dead ends: 334 [2025-03-04 11:25:52,566 INFO L226 Difference]: Without dead ends: 333 [2025-03-04 11:25:52,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 279 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:25:52,567 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:52,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 453 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:25:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-04 11:25:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 297. [2025-03-04 11:25:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 262 states have (on average 1.0610687022900764) internal successors, (278), 268 states have internal predecessors, (278), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 11:25:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 324 transitions. [2025-03-04 11:25:52,579 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 324 transitions. Word has length 146 [2025-03-04 11:25:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:52,580 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 324 transitions. [2025-03-04 11:25:52,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 16.0) internal successors, (304), 20 states have internal predecessors, (304), 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:25:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 324 transitions. [2025-03-04 11:25:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 11:25:52,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:52,581 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, 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] [2025-03-04 11:25:52,587 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:25:52,781 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:25:52,781 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:52,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1849412923, now seen corresponding path program 2 times [2025-03-04 11:25:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976543246] [2025-03-04 11:25:52,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:52,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-04 11:25:52,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:25:52,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:52,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:25:52,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976543246] [2025-03-04 11:25:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976543246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55650538] [2025-03-04 11:25:52,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:52,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:52,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:52,942 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:25:52,943 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:25:52,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-04 11:25:52,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:25:52,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:52,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:52,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:25:52,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:25:53,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:25:53,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55650538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:53,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:25:53,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 11:25:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662855542] [2025-03-04 11:25:53,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:53,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 11:25:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:53,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 11:25:53,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:25:53,520 INFO L87 Difference]: Start difference. First operand 297 states and 324 transitions. Second operand has 22 states, 21 states have (on average 16.19047619047619) internal successors, (340), 22 states have internal predecessors, (340), 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:25:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:53,841 INFO L93 Difference]: Finished difference Result 375 states and 410 transitions. [2025-03-04 11:25:53,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:25:53,842 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 16.19047619047619) internal successors, (340), 22 states have internal predecessors, (340), 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 174 [2025-03-04 11:25:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:53,843 INFO L225 Difference]: With dead ends: 375 [2025-03-04 11:25:53,843 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 11:25:53,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 334 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:25:53,844 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 230 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:53,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 379 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:25:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 11:25:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 331. [2025-03-04 11:25:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 292 states have (on average 1.0582191780821917) internal successors, (309), 298 states have internal predecessors, (309), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 11:25:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 363 transitions. [2025-03-04 11:25:53,858 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 363 transitions. Word has length 174 [2025-03-04 11:25:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:53,858 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 363 transitions. [2025-03-04 11:25:53,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 16.19047619047619) internal successors, (340), 22 states have internal predecessors, (340), 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:25:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 363 transitions. [2025-03-04 11:25:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-04 11:25:53,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:53,860 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:53,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:25:54,060 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:25:54,060 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:54,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash 183393091, now seen corresponding path program 2 times [2025-03-04 11:25:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776001094] [2025-03-04 11:25:54,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:54,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-04 11:25:54,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 11:25:54,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:54,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:25:54,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:54,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776001094] [2025-03-04 11:25:54,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776001094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:54,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923437127] [2025-03-04 11:25:54,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:54,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:54,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:54,349 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:25:54,350 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:25:54,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-04 11:25:54,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 11:25:54,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:54,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:54,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:25:54,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 448 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:25:54,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:25:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923437127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:54,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:25:54,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 26 [2025-03-04 11:25:54,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525274681] [2025-03-04 11:25:54,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:54,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:25:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:54,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:25:54,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:25:54,821 INFO L87 Difference]: Start difference. First operand 331 states and 363 transitions. Second operand has 26 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 9 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 9 states have call predecessors, (38), 9 states have call successors, (38) [2025-03-04 11:25:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:55,121 INFO L93 Difference]: Finished difference Result 485 states and 515 transitions. [2025-03-04 11:25:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 11:25:55,121 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 9 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 9 states have call predecessors, (38), 9 states have call successors, (38) Word has length 213 [2025-03-04 11:25:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:55,123 INFO L225 Difference]: With dead ends: 485 [2025-03-04 11:25:55,125 INFO L226 Difference]: Without dead ends: 448 [2025-03-04 11:25:55,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=604, Invalid=1288, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 11:25:55,126 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 156 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:55,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1079 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-04 11:25:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 433. [2025-03-04 11:25:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 383 states have (on average 1.0574412532637076) internal successors, (405), 389 states have internal predecessors, (405), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 11:25:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 469 transitions. [2025-03-04 11:25:55,142 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 469 transitions. Word has length 213 [2025-03-04 11:25:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:55,142 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 469 transitions. [2025-03-04 11:25:55,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 9 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 9 states have call predecessors, (38), 9 states have call successors, (38) [2025-03-04 11:25:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 469 transitions. [2025-03-04 11:25:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-04 11:25:55,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:55,144 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 4, 4, 4, 4, 1, 1, 1] [2025-03-04 11:25:55,150 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:25:55,344 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:25:55,344 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:55,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash 895238416, now seen corresponding path program 2 times [2025-03-04 11:25:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:55,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618882845] [2025-03-04 11:25:55,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:55,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-04 11:25:55,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 11:25:55,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:55,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:25:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352856099] [2025-03-04 11:25:55,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:55,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:55,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:55,370 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:25:55,371 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:25:55,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-04 11:25:55,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 11:25:55,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:55,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:55,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:25:55,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:25:55,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:25:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618882845] [2025-03-04 11:25:55,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352856099] [2025-03-04 11:25:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352856099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:55,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:25:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 11:25:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881336464] [2025-03-04 11:25:55,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:55,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:25:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:55,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:25:55,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:25:55,810 INFO L87 Difference]: Start difference. First operand 433 states and 469 transitions. Second operand has 12 states, 11 states have (on average 27.09090909090909) internal successors, (298), 12 states have internal predecessors, (298), 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:25:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:56,150 INFO L93 Difference]: Finished difference Result 455 states and 482 transitions. [2025-03-04 11:25:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:25:56,152 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.09090909090909) internal successors, (298), 12 states have internal predecessors, (298), 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 213 [2025-03-04 11:25:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:56,153 INFO L225 Difference]: With dead ends: 455 [2025-03-04 11:25:56,153 INFO L226 Difference]: Without dead ends: 454 [2025-03-04 11:25:56,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 414 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:25:56,155 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 145 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:56,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 815 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:25:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-04 11:25:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 444. [2025-03-04 11:25:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 393 states have (on average 1.0432569974554708) internal successors, (410), 399 states have internal predecessors, (410), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:25:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 476 transitions. [2025-03-04 11:25:56,171 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 476 transitions. Word has length 213 [2025-03-04 11:25:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:56,171 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 476 transitions. [2025-03-04 11:25:56,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.09090909090909) internal successors, (298), 12 states have internal predecessors, (298), 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:25:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 476 transitions. [2025-03-04 11:25:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-04 11:25:56,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:56,172 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 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] [2025-03-04 11:25:56,178 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:25:56,372 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:25:56,373 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:56,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2044093663, now seen corresponding path program 2 times [2025-03-04 11:25:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:56,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256706693] [2025-03-04 11:25:56,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:56,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-03-04 11:25:56,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 220 of 220 statements. [2025-03-04 11:25:56,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:25:56,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718067326] [2025-03-04 11:25:56,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:56,397 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:25:56,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:25:56,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-03-04 11:25:56,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 220 of 220 statements. [2025-03-04 11:25:56,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:56,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:56,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:25:56,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:25:56,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:25:56,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:56,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256706693] [2025-03-04 11:25:56,846 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:56,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718067326] [2025-03-04 11:25:56,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718067326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:56,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:25:56,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 11:25:56,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377575813] [2025-03-04 11:25:56,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:56,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:25:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:56,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:25:56,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:25:56,848 INFO L87 Difference]: Start difference. First operand 444 states and 476 transitions. Second operand has 12 states, 11 states have (on average 27.454545454545453) internal successors, (302), 12 states have internal predecessors, (302), 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:25:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:57,179 INFO L93 Difference]: Finished difference Result 450 states and 481 transitions. [2025-03-04 11:25:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:25:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.454545454545453) internal successors, (302), 12 states have internal predecessors, (302), 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 220 [2025-03-04 11:25:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:57,181 INFO L225 Difference]: With dead ends: 450 [2025-03-04 11:25:57,181 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 11:25:57,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 428 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:25:57,182 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 100 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:57,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 896 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:25:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 11:25:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2025-03-04 11:25:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 395 states have (on average 1.030379746835443) internal successors, (407), 401 states have internal predecessors, (407), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 11:25:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 475 transitions. [2025-03-04 11:25:57,196 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 475 transitions. Word has length 220 [2025-03-04 11:25:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:57,196 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 475 transitions. [2025-03-04 11:25:57,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.454545454545453) internal successors, (302), 12 states have internal predecessors, (302), 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:25:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 475 transitions. [2025-03-04 11:25:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-04 11:25:57,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:57,199 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, 7, 7, 7, 7, 6, 1, 1, 1] [2025-03-04 11:25:57,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:25:57,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 11:25:57,399 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:57,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1428383017, now seen corresponding path program 2 times [2025-03-04 11:25:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:57,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006266587] [2025-03-04 11:25:57,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:57,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 338 statements into 2 equivalence classes. [2025-03-04 11:25:57,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 338 of 338 statements. [2025-03-04 11:25:57,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:57,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-04 11:25:57,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:57,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006266587] [2025-03-04 11:25:57,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006266587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:57,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581577248] [2025-03-04 11:25:57,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:25:57,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:57,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:57,549 INFO L229 MonitoredProcess]: Starting monitored process 18 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:25:57,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:25:57,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 338 statements into 2 equivalence classes. [2025-03-04 11:25:57,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 338 of 338 statements. [2025-03-04 11:25:57,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:25:57,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:57,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:25:57,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-04 11:25:57,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-04 11:25:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581577248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:58,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:25:58,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 11:25:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911817567] [2025-03-04 11:25:58,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:58,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:25:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:58,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:25:58,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:25:58,154 INFO L87 Difference]: Start difference. First operand 447 states and 475 transitions. Second operand has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 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:25:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:58,270 INFO L93 Difference]: Finished difference Result 447 states and 475 transitions. [2025-03-04 11:25:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:25:58,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 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 338 [2025-03-04 11:25:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:58,272 INFO L225 Difference]: With dead ends: 447 [2025-03-04 11:25:58,272 INFO L226 Difference]: Without dead ends: 446 [2025-03-04 11:25:58,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 668 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:25:58,272 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 241 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:58,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 245 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-04 11:25:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-03-04 11:25:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 395 states have (on average 1.0202531645569621) internal successors, (403), 400 states have internal predecessors, (403), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 11:25:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 471 transitions. [2025-03-04 11:25:58,287 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 471 transitions. Word has length 338 [2025-03-04 11:25:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:58,288 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 471 transitions. [2025-03-04 11:25:58,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 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:25:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 471 transitions. [2025-03-04 11:25:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-04 11:25:58,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:58,290 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, 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] [2025-03-04 11:25:58,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 11:25:58,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:58,491 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:25:58,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:58,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2088487507, now seen corresponding path program 3 times [2025-03-04 11:25:58,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:58,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953668747] [2025-03-04 11:25:58,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:25:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:58,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 366 statements into 10 equivalence classes. [2025-03-04 11:25:58,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 135 of 366 statements. [2025-03-04 11:25:58,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 11:25:58,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 51 proven. 466 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2025-03-04 11:25:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953668747] [2025-03-04 11:25:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953668747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992857736] [2025-03-04 11:25:58,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:25:58,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:58,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:58,685 INFO L229 MonitoredProcess]: Starting monitored process 19 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:25:58,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:25:58,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 366 statements into 10 equivalence classes. [2025-03-04 11:25:58,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 366 statements. [2025-03-04 11:25:58,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 11:25:58,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:58,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:25:58,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 126 proven. 176 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2025-03-04 11:25:59,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992857736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:59,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:25:59,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-03-04 11:25:59,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6721358] [2025-03-04 11:25:59,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:59,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:25:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:59,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:25:59,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:25:59,466 INFO L87 Difference]: Start difference. First operand 446 states and 471 transitions. Second operand has 16 states, 15 states have (on average 9.066666666666666) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:25:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:59,898 INFO L93 Difference]: Finished difference Result 446 states and 471 transitions. [2025-03-04 11:25:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:25:59,898 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 9.066666666666666) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 366 [2025-03-04 11:25:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:59,900 INFO L225 Difference]: With dead ends: 446 [2025-03-04 11:25:59,900 INFO L226 Difference]: Without dead ends: 442 [2025-03-04 11:25:59,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:25:59,901 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 388 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:59,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 165 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:25:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-04 11:25:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-04 11:25:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 393 states have (on average 1.0101781170483461) internal successors, (397), 396 states have internal predecessors, (397), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 11:25:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 465 transitions. [2025-03-04 11:25:59,931 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 465 transitions. Word has length 366 [2025-03-04 11:25:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:59,931 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 465 transitions. [2025-03-04 11:25:59,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 9.066666666666666) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:25:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 465 transitions. [2025-03-04 11:25:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-04 11:25:59,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:59,934 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:59,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:00,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:00,139 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:26:00,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:00,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1935798425, now seen corresponding path program 3 times [2025-03-04 11:26:00,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:00,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206232409] [2025-03-04 11:26:00,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:26:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:00,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 501 statements into 15 equivalence classes. [2025-03-04 11:26:00,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 501 of 501 statements. [2025-03-04 11:26:00,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 11:26:00,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:26:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588000709] [2025-03-04 11:26:00,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:26:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:00,247 INFO L229 MonitoredProcess]: Starting monitored process 20 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:00,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:26:00,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 501 statements into 15 equivalence classes. [2025-03-04 11:26:00,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 78 of 501 statements. [2025-03-04 11:26:00,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:26:00,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:00,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:26:00,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2025-03-04 11:26:00,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:26:00,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:00,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206232409] [2025-03-04 11:26:00,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:26:00,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588000709] [2025-03-04 11:26:00,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588000709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:00,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:00,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:26:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411601176] [2025-03-04 11:26:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:00,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:26:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:00,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:26:00,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:26:00,454 INFO L87 Difference]: Start difference. First operand 442 states and 465 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:26:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:00,770 INFO L93 Difference]: Finished difference Result 462 states and 485 transitions. [2025-03-04 11:26:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:26:00,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 501 [2025-03-04 11:26:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:00,773 INFO L225 Difference]: With dead ends: 462 [2025-03-04 11:26:00,773 INFO L226 Difference]: Without dead ends: 460 [2025-03-04 11:26:00,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:26:00,773 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:00,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 87 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-04 11:26:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 440. [2025-03-04 11:26:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 393 states have (on average 1.005089058524173) internal successors, (395), 394 states have internal predecessors, (395), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 11:26:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 463 transitions. [2025-03-04 11:26:00,806 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 463 transitions. Word has length 501 [2025-03-04 11:26:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:00,806 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 463 transitions. [2025-03-04 11:26:00,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:26:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 463 transitions. [2025-03-04 11:26:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-03-04 11:26:00,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:00,810 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:00,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:01,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:01,011 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:26:01,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash -167457986, now seen corresponding path program 1 times [2025-03-04 11:26:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924516415] [2025-03-04 11:26:01,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:01,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-04 11:26:01,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-04 11:26:01,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:01,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:26:01,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345397087] [2025-03-04 11:26:01,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:01,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:01,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:01,060 INFO L229 MonitoredProcess]: Starting monitored process 21 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:01,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:26:01,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-04 11:26:01,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-04 11:26:01,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:01,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:01,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:26:01,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3644 backedges. 0 proven. 1660 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-04 11:26:01,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3644 backedges. 0 proven. 1660 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-04 11:26:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:02,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924516415] [2025-03-04 11:26:02,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:26:02,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345397087] [2025-03-04 11:26:02,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345397087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:02,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:26:02,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-03-04 11:26:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781404447] [2025-03-04 11:26:02,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:02,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:26:02,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:02,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:26:02,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:26:02,241 INFO L87 Difference]: Start difference. First operand 440 states and 463 transitions. Second operand has 24 states, 23 states have (on average 30.347826086956523) internal successors, (698), 24 states have internal predecessors, (698), 22 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2025-03-04 11:26:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:03,556 INFO L93 Difference]: Finished difference Result 1042 states and 1147 transitions. [2025-03-04 11:26:03,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:26:03,556 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 30.347826086956523) internal successors, (698), 24 states have internal predecessors, (698), 22 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) Word has length 508 [2025-03-04 11:26:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:03,559 INFO L225 Difference]: With dead ends: 1042 [2025-03-04 11:26:03,559 INFO L226 Difference]: Without dead ends: 872 [2025-03-04 11:26:03,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1024 GetRequests, 992 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:26:03,560 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1013 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:03,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 3266 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:26:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-04 11:26:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-04 11:26:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 789 states have (on average 1.002534854245881) internal successors, (791), 790 states have internal predecessors, (791), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 11:26:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 931 transitions. [2025-03-04 11:26:03,619 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 931 transitions. Word has length 508 [2025-03-04 11:26:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:03,619 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 931 transitions. [2025-03-04 11:26:03,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 30.347826086956523) internal successors, (698), 24 states have internal predecessors, (698), 22 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2025-03-04 11:26:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 931 transitions. [2025-03-04 11:26:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2025-03-04 11:26:03,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:03,628 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:03,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:03,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:26:03,828 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-04 11:26:03,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:03,829 INFO L85 PathProgramCache]: Analyzing trace with hash 968700406, now seen corresponding path program 2 times [2025-03-04 11:26:03,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:03,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962537681] [2025-03-04 11:26:03,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:03,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:03,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1084 statements into 2 equivalence classes. [2025-03-04 11:26:03,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1084 of 1084 statements. [2025-03-04 11:26:03,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:03,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 17516 backedges. 8300 proven. 104 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 11:26:06,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962537681] [2025-03-04 11:26:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962537681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494535953] [2025-03-04 11:26:06,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:06,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:06,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:06,498 INFO L229 MonitoredProcess]: Starting monitored process 22 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:06,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 11:26:06,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1084 statements into 2 equivalence classes. [2025-03-04 11:26:06,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1084 of 1084 statements. [2025-03-04 11:26:06,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:06,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:06,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:26:06,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 17516 backedges. 12198 proven. 10 refuted. 0 times theorem prover too weak. 5308 trivial. 0 not checked. [2025-03-04 11:26:07,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17516 backedges. 6018 proven. 10 refuted. 0 times theorem prover too weak. 11488 trivial. 0 not checked. [2025-03-04 11:26:07,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494535953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:07,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:07,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 23, 24] total 49 [2025-03-04 11:26:07,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565938577] [2025-03-04 11:26:07,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:07,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 11:26:07,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:07,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 11:26:07,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=1789, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 11:26:07,599 INFO L87 Difference]: Start difference. First operand 872 states and 931 transitions. Second operand has 49 states, 49 states have (on average 16.102040816326532) internal successors, (789), 49 states have internal predecessors, (789), 22 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (103), 22 states have call predecessors, (103), 22 states have call successors, (103) [2025-03-04 11:26:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:08,041 INFO L93 Difference]: Finished difference Result 876 states and 934 transitions. [2025-03-04 11:26:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 11:26:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 16.102040816326532) internal successors, (789), 49 states have internal predecessors, (789), 22 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (103), 22 states have call predecessors, (103), 22 states have call successors, (103) Word has length 1084 [2025-03-04 11:26:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:08,042 INFO L225 Difference]: With dead ends: 876 [2025-03-04 11:26:08,042 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:26:08,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2234 GetRequests, 2145 SyntacticMatches, 21 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1069, Invalid=3761, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 11:26:08,044 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 33 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:08,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3249 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:26:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:26:08,044 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:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:26:08,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1084 [2025-03-04 11:26:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:08,045 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:26:08,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 16.102040816326532) internal successors, (789), 49 states have internal predecessors, (789), 22 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (103), 22 states have call predecessors, (103), 22 states have call successors, (103) [2025-03-04 11:26:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:26:08,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:26:08,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 52 remaining) [2025-03-04 11:26:08,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2025-03-04 11:26:08,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2025-03-04 11:26:08,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2025-03-04 11:26:08,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2025-03-04 11:26:08,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2025-03-04 11:26:08,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2025-03-04 11:26:08,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2025-03-04 11:26:08,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2025-03-04 11:26:08,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2025-03-04 11:26:08,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2025-03-04 11:26:08,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2025-03-04 11:26:08,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:08,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 11:26:08,254 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:08,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:26:09,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:26:09,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:26:09 BoogieIcfgContainer [2025-03-04 11:26:09,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:26:09,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:26:09,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:26:09,878 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:26:09,881 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:25:43" (3/4) ... [2025-03-04 11:26:09,883 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:26:09,896 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:26:09,907 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:26:09,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:26:09,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:26:09,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:26:09,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:26:09,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:26:09,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:26:09,985 INFO L158 Benchmark]: Toolchain (without parser) took 26702.01ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 124.7MB in the beginning and 220.2MB in the end (delta: -95.4MB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. [2025-03-04 11:26:09,985 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:26:09,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.14ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 113.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:26:09,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.89ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 111.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:26:09,985 INFO L158 Benchmark]: Boogie Preprocessor took 28.24ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 111.2MB in the end (delta: 341.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:26:09,986 INFO L158 Benchmark]: IcfgBuilder took 372.70ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 91.4MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:26:09,986 INFO L158 Benchmark]: TraceAbstraction took 26003.41ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 90.4MB in the beginning and 233.9MB in the end (delta: -143.4MB). Peak memory consumption was 300.9MB. Max. memory is 16.1GB. [2025-03-04 11:26:09,986 INFO L158 Benchmark]: Witness Printer took 106.25ms. Allocated memory is still 578.8MB. Free memory was 233.9MB in the beginning and 220.2MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:26:09,987 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.17ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.14ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 113.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.89ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 111.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.24ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 111.2MB in the end (delta: 341.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 372.70ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 91.4MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26003.41ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 90.4MB in the beginning and 233.9MB in the end (delta: -143.4MB). Peak memory consumption was 300.9MB. Max. memory is 16.1GB. * Witness Printer took 106.25ms. Allocated memory is still 578.8MB. Free memory was 233.9MB in the beginning and 220.2MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. 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 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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, 125 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 28, TraceHistogramMax: 68, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4268 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4195 mSDsluCounter, 15428 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12487 mSDsCounter, 542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7103 IncrementalHoareTripleChecker+Invalid, 7645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 542 mSolverCounterUnsat, 2941 mSDtfsCounter, 7103 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8029 GetRequests, 7641 SyntacticMatches, 21 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3386 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=872occurred in iteration=27, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 525 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 9119 NumberOfCodeBlocks, 8149 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 10769 ConstructedInterpolants, 4 QuantifiedInterpolants, 34476 SizeOfPredicates, 46 NumberOfNonLiveVariables, 5925 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 56 InterpolantComputations, 13 PerfectInterpolantSequences, 71557/78929 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 52 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: ((((((((((((((((n <= 2147483647) && (s == 100)) && (1 <= a)) && ((((__int128) a * a) + ((__int128) 2 * a)) <= 9223372036854775806)) && (counter == 9)) && (19 == t)) || ((((((counter == 7) && (n <= 2147483647)) && (t == 15)) && (1 <= a)) && (64 == s)) && ((((__int128) a * a) + ((__int128) 6 * a)) <= 9223372036854775798))) || (((((counter == 3) && (n <= 2147483647)) && (16 == s)) && (7 == t)) && (3 == a))) || (((((n <= 2147483647) && (3 == t)) && (a == 1)) && (s == 4)) && (counter == 1))) || ((((((n <= 2147483647) && (counter == 8)) && (t == 17)) && (81 == s)) && (1 <= a)) && ((((__int128) a * a) + ((__int128) a * 4)) <= 9223372036854775803))) || (((((n <= 2147483647) && (s == 25)) && (counter == 4)) && (9 == t)) && (a == 4))) || ((((((n <= 2147483647) && (s == 36)) && (counter == 5)) && (t == 11)) && (1 <= a)) && ((((__int128) a * 10) + ((__int128) a * a)) <= 9223372036854775782))) || (((((n <= 2147483647) && (5 == t)) && (9 == s)) && (2 == a)) && (counter == 2))) || (((((n <= 2147483647) && (t == 1)) && (counter == 0)) && (a == 0)) && (s == 1))) || ((((((n <= 2147483647) && (counter == 10)) && (s == 121)) && (21 == t)) && (1 <= a)) && (a <= 4611686018427387903))) || ((((((n <= 2147483647) && (49 == s)) && (t == 13)) && (1 <= a)) && (counter == 6)) && ((((__int128) a * 8) + ((__int128) a * a)) <= 9223372036854775791))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:26:10,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE