./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id_i5_o5-2.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/recursive-simple/id_i5_o5-2.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 1be5a7d97aa41e02c549ddce0b54861696e25bfa9b91d41dbf151eb81f7686c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:30:12,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:30:12,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:30:12,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:30:12,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:30:12,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:30:12,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:30:12,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:30:12,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:30:12,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:30:12,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:30:12,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:30:12,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:30:12,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:30:12,630 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:30:12,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:30:12,631 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:30:12,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:30:12,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:30:12,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:30:12,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:30:12,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:30:12,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:30:12,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:12,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:30:12,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:30:12,633 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 -> 1be5a7d97aa41e02c549ddce0b54861696e25bfa9b91d41dbf151eb81f7686c7 [2025-03-04 11:30:12,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:30:12,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:30:12,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:30:12,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:30:12,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:30:12,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2025-03-04 11:30:13,959 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0e9e66f/8d607bc4328747f2b7bb1a8be042fb99/FLAGefe5c181d [2025-03-04 11:30:14,141 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:30:14,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2025-03-04 11:30:14,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0e9e66f/8d607bc4328747f2b7bb1a8be042fb99/FLAGefe5c181d [2025-03-04 11:30:14,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0e9e66f/8d607bc4328747f2b7bb1a8be042fb99 [2025-03-04 11:30:14,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:30:14,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:30:14,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:14,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:30:14,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:30:14,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738da5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14, skipping insertion in model container [2025-03-04 11:30:14,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:30:14,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:14,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:30:14,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:14,647 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:30:14,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14 WrapperNode [2025-03-04 11:30:14,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:14,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:14,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:30:14,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:30:14,653 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:30:14" (1/1) ... [2025-03-04 11:30:14,658 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:30:14" (1/1) ... [2025-03-04 11:30:14,666 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2025-03-04 11:30:14,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:14,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:30:14,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:30:14,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:30:14,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,681 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:30:14,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:30:14,689 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:30:14,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:30:14,690 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:30:14,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (1/1) ... [2025-03-04 11:30:14,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:14,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:14,718 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:30:14,720 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:30:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:30:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:30:14,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:30:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:30:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-03-04 11:30:14,735 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-03-04 11:30:14,774 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:30:14,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:30:14,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2025-03-04 11:30:14,864 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-04 11:30:14,866 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:30:14,876 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:30:14,876 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:30:14,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:14 BoogieIcfgContainer [2025-03-04 11:30:14,877 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:30:14,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:30:14,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:30:14,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:30:14,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:30:14" (1/3) ... [2025-03-04 11:30:14,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65930b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:30:14, skipping insertion in model container [2025-03-04 11:30:14,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:14" (2/3) ... [2025-03-04 11:30:14,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65930b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:30:14, skipping insertion in model container [2025-03-04 11:30:14,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:14" (3/3) ... [2025-03-04 11:30:14,886 INFO L128 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2025-03-04 11:30:14,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:30:14,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_i5_o5-2.c that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 11:30:14,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:30:14,950 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;@2a172ac7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:30:14,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 11:30:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:30:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:30:14,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:14,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:30:14,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:14,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:14,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1123769116, now seen corresponding path program 1 times [2025-03-04 11:30:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257956941] [2025-03-04 11:30:14,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:15,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:30:15,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:30:15,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:15,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,097 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:30:15,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:15,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257956941] [2025-03-04 11:30:15,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257956941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:15,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:15,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:30:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725890779] [2025-03-04 11:30:15,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:15,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:15,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:15,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:15,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:15,115 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:15,174 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-03-04 11:30:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:15,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:30:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:15,179 INFO L225 Difference]: With dead ends: 46 [2025-03-04 11:30:15,179 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 11:30:15,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:30:15,182 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:15,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 11:30:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-04 11:30:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:30:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-04 11:30:15,205 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 6 [2025-03-04 11:30:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:15,205 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-04 11:30:15,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-04 11:30:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:30:15,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:15,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:15,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:30:15,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:15,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:15,206 INFO L85 PathProgramCache]: Analyzing trace with hash 477104215, now seen corresponding path program 1 times [2025-03-04 11:30:15,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:15,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136907890] [2025-03-04 11:30:15,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:15,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:30:15,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:30:15,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:15,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,270 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:30:15,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:15,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136907890] [2025-03-04 11:30:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136907890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:15,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:15,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:30:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921101703] [2025-03-04 11:30:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:15,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:15,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:15,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:15,272 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:15,299 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-03-04 11:30:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:30:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:15,301 INFO L225 Difference]: With dead ends: 27 [2025-03-04 11:30:15,301 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 11:30:15,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:30:15,302 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:15,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 11:30:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-04 11:30:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:30:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-04 11:30:15,309 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2025-03-04 11:30:15,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:15,311 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-04 11:30:15,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-04 11:30:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 11:30:15,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:15,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:15,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:30:15,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:15,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash -638284688, now seen corresponding path program 1 times [2025-03-04 11:30:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:15,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153398659] [2025-03-04 11:30:15,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:15,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:15,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:30:15,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:30:15,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:15,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:15,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153398659] [2025-03-04 11:30:15,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153398659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:15,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411322948] [2025-03-04 11:30:15,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:15,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:15,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:15,405 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:30:15,406 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:30:15,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:30:15,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:30:15,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:15,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:30:15,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:15,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411322948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:15,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 11:30:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345964184] [2025-03-04 11:30:15,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:15,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:30:15,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:15,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:30:15,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:30:15,552 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:15,677 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-03-04 11:30:15,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:30:15,677 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 11:30:15,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:15,678 INFO L225 Difference]: With dead ends: 76 [2025-03-04 11:30:15,678 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 11:30:15,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:30:15,678 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 99 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:15,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 95 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 11:30:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-03-04 11:30:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:30:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-04 11:30:15,691 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 11 [2025-03-04 11:30:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:15,691 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-04 11:30:15,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-04 11:30:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:30:15,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:15,692 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:15,699 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:30:15,897 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:30:15,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:15,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash -16539686, now seen corresponding path program 1 times [2025-03-04 11:30:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:15,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593394988] [2025-03-04 11:30:15,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:15,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:30:15,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:30:15,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:15,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:30:15,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:15,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593394988] [2025-03-04 11:30:15,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593394988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:15,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:15,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:30:15,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750882815] [2025-03-04 11:30:15,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:15,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:30:15,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:15,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:30:15,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:30:15,945 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:30:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:15,961 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2025-03-04 11:30:15,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:30:15,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-04 11:30:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:15,963 INFO L225 Difference]: With dead ends: 74 [2025-03-04 11:30:15,963 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 11:30:15,963 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:30:15,964 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:15,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 11:30:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 11:30:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 57 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:30:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-03-04 11:30:15,979 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 19 [2025-03-04 11:30:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:15,979 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-03-04 11:30:15,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:30:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-03-04 11:30:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:30:15,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:15,980 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:15,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:30:15,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1336297931, now seen corresponding path program 1 times [2025-03-04 11:30:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:15,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139305770] [2025-03-04 11:30:15,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:15,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:30:15,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:30:15,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:15,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:30:16,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:16,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139305770] [2025-03-04 11:30:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139305770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:16,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:16,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:30:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292694126] [2025-03-04 11:30:16,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:16,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:30:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:16,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:30:16,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:30:16,037 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:30:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:16,049 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-03-04 11:30:16,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:30:16,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-04 11:30:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:16,051 INFO L225 Difference]: With dead ends: 72 [2025-03-04 11:30:16,051 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 11:30:16,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:30:16,052 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:16,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 11:30:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 11:30:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:30:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-03-04 11:30:16,061 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 24 [2025-03-04 11:30:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:16,061 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-04 11:30:16,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:30:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2025-03-04 11:30:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:30:16,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:16,062 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 11:30:16,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:30:16,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:16,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash -543218660, now seen corresponding path program 2 times [2025-03-04 11:30:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:16,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646832214] [2025-03-04 11:30:16,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:16,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:16,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 11:30:16,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:30:16,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:16,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:16,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646832214] [2025-03-04 11:30:16,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646832214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:16,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151723482] [2025-03-04 11:30:16,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:16,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:16,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:16,229 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:30:16,231 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:30:16,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 11:30:16,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:30:16,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:16,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:16,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:30:16,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:16,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:16,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151723482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:16,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:16,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 11:30:16,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81221518] [2025-03-04 11:30:16,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:16,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:30:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:16,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:30:16,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:30:16,492 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:16,759 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2025-03-04 11:30:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:30:16,759 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 11:30:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:16,760 INFO L225 Difference]: With dead ends: 188 [2025-03-04 11:30:16,761 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:30:16,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:30:16,763 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 247 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:16,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 223 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:30:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2025-03-04 11:30:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 116 states have (on average 1.146551724137931) internal successors, (133), 116 states have internal predecessors, (133), 12 states have call successors, (12), 11 states have call predecessors, (12), 16 states have return successors, (18), 18 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-04 11:30:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2025-03-04 11:30:16,786 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 26 [2025-03-04 11:30:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:16,786 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2025-03-04 11:30:16,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2025-03-04 11:30:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 11:30:16,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:16,787 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:16,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:30:16,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 11:30:16,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:16,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:16,989 INFO L85 PathProgramCache]: Analyzing trace with hash -98645244, now seen corresponding path program 1 times [2025-03-04 11:30:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:16,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853605602] [2025-03-04 11:30:16,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:16,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:30:16,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:30:16,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:16,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:30:17,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:17,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853605602] [2025-03-04 11:30:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853605602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:17,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490279458] [2025-03-04 11:30:17,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:17,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:17,046 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:30:17,060 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:30:17,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:30:17,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:30:17,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:17,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:17,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:30:17,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:30:17,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:30:17,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490279458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:17,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:17,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 11:30:17,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888094291] [2025-03-04 11:30:17,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:17,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:30:17,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:17,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:30:17,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:30:17,198 INFO L87 Difference]: Start difference. First operand 146 states and 163 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:30:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:17,231 INFO L93 Difference]: Finished difference Result 276 states and 322 transitions. [2025-03-04 11:30:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:30:17,232 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2025-03-04 11:30:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:17,233 INFO L225 Difference]: With dead ends: 276 [2025-03-04 11:30:17,233 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 11:30:17,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:30:17,234 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:17,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 11:30:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-04 11:30:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 221 states have (on average 1.0769230769230769) internal successors, (238), 218 states have internal predecessors, (238), 12 states have call successors, (12), 11 states have call predecessors, (12), 40 states have return successors, (45), 45 states have call predecessors, (45), 11 states have call successors, (45) [2025-03-04 11:30:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 295 transitions. [2025-03-04 11:30:17,263 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 295 transitions. Word has length 40 [2025-03-04 11:30:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:17,264 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 295 transitions. [2025-03-04 11:30:17,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:30:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 295 transitions. [2025-03-04 11:30:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:30:17,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:17,265 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-03-04 11:30:17,273 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:30:17,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:17,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:17,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:17,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1018977892, now seen corresponding path program 3 times [2025-03-04 11:30:17,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:17,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500112473] [2025-03-04 11:30:17,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:17,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:17,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-04 11:30:17,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:30:17,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:17,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500112473] [2025-03-04 11:30:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500112473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448839846] [2025-03-04 11:30:17,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:17,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:17,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:17,851 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:30:17,852 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:30:17,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-04 11:30:17,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:30:17,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:17,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:17,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:30:17,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:17,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448839846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:18,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:18,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 11:30:18,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662680635] [2025-03-04 11:30:18,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:18,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:30:18,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:18,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:30:18,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:30:18,456 INFO L87 Difference]: Start difference. First operand 275 states and 295 transitions. Second operand has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:18,578 INFO L93 Difference]: Finished difference Result 280 states and 295 transitions. [2025-03-04 11:30:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:30:18,578 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-04 11:30:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:18,580 INFO L225 Difference]: With dead ends: 280 [2025-03-04 11:30:18,580 INFO L226 Difference]: Without dead ends: 279 [2025-03-04 11:30:18,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=860, Invalid=2110, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:30:18,581 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 156 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:18,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 115 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-04 11:30:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 274. [2025-03-04 11:30:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 221 states have (on average 1.0723981900452488) internal successors, (237), 217 states have internal predecessors, (237), 12 states have call successors, (12), 11 states have call predecessors, (12), 40 states have return successors, (45), 45 states have call predecessors, (45), 11 states have call successors, (45) [2025-03-04 11:30:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 294 transitions. [2025-03-04 11:30:18,597 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 294 transitions. Word has length 56 [2025-03-04 11:30:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:18,597 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 294 transitions. [2025-03-04 11:30:18,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 294 transitions. [2025-03-04 11:30:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:30:18,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:18,600 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2025-03-04 11:30:18,606 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:30:18,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:18,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:18,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash -225984153, now seen corresponding path program 2 times [2025-03-04 11:30:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:18,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098918570] [2025-03-04 11:30:18,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:18,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-04 11:30:18,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:30:18,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:18,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:30:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098918570] [2025-03-04 11:30:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098918570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170224130] [2025-03-04 11:30:18,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:18,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:18,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:18,940 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:30:18,941 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:30:18,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-04 11:30:18,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:30:18,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:18,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:18,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:30:18,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:30:19,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:30:19,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170224130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:19,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:19,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 11:30:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974982263] [2025-03-04 11:30:19,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:30:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:19,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:30:19,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:30:19,464 INFO L87 Difference]: Start difference. First operand 274 states and 294 transitions. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 11:30:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:19,530 INFO L93 Difference]: Finished difference Result 593 states and 678 transitions. [2025-03-04 11:30:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:30:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 55 [2025-03-04 11:30:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:19,531 INFO L225 Difference]: With dead ends: 593 [2025-03-04 11:30:19,531 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 11:30:19,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:30:19,533 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:19,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 11:30:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-04 11:30:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 300 states have (on average 1.0366666666666666) internal successors, (311), 291 states have internal predecessors, (311), 12 states have call successors, (12), 11 states have call predecessors, (12), 56 states have return successors, (66), 66 states have call predecessors, (66), 11 states have call successors, (66) [2025-03-04 11:30:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 389 transitions. [2025-03-04 11:30:19,551 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 389 transitions. Word has length 55 [2025-03-04 11:30:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:19,551 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 389 transitions. [2025-03-04 11:30:19,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 11:30:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 389 transitions. [2025-03-04 11:30:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 11:30:19,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:19,557 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1] [2025-03-04 11:30:19,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:30:19,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:19,757 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:19,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash -22556089, now seen corresponding path program 3 times [2025-03-04 11:30:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756891296] [2025-03-04 11:30:19,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:19,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 12 equivalence classes. [2025-03-04 11:30:19,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 110 of 115 statements. [2025-03-04 11:30:19,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:19,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:30:20,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:20,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756891296] [2025-03-04 11:30:20,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756891296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:20,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042227546] [2025-03-04 11:30:20,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:20,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:20,092 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:30:20,093 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:30:20,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 12 equivalence classes. [2025-03-04 11:30:20,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 110 of 115 statements. [2025-03-04 11:30:20,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:20,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:20,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:30:20,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:30:20,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:30:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042227546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:23,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-03-04 11:30:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114884805] [2025-03-04 11:30:23,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:23,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:30:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:23,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:30:23,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:30:23,753 INFO L87 Difference]: Start difference. First operand 369 states and 389 transitions. Second operand has 48 states, 47 states have (on average 2.148936170212766) internal successors, (101), 48 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (23), 23 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 11:30:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:23,887 INFO L93 Difference]: Finished difference Result 1006 states and 1157 transitions. [2025-03-04 11:30:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:30:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.148936170212766) internal successors, (101), 48 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (23), 23 states have call predecessors, (23), 1 states have call successors, (23) Word has length 115 [2025-03-04 11:30:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:23,889 INFO L225 Difference]: With dead ends: 1006 [2025-03-04 11:30:23,889 INFO L226 Difference]: Without dead ends: 429 [2025-03-04 11:30:23,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:30:23,892 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:23,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-04 11:30:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-03-04 11:30:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 348 states have (on average 1.0316091954022988) internal successors, (359), 339 states have internal predecessors, (359), 12 states have call successors, (12), 11 states have call predecessors, (12), 68 states have return successors, (78), 78 states have call predecessors, (78), 11 states have call successors, (78) [2025-03-04 11:30:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 449 transitions. [2025-03-04 11:30:23,910 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 449 transitions. Word has length 115 [2025-03-04 11:30:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:23,910 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 449 transitions. [2025-03-04 11:30:23,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.148936170212766) internal successors, (101), 48 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (23), 23 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 11:30:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 449 transitions. [2025-03-04 11:30:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-04 11:30:23,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:23,913 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1] [2025-03-04 11:30:23,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:30:24,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:24,113 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:24,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1278518265, now seen corresponding path program 4 times [2025-03-04 11:30:24,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:24,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269089080] [2025-03-04 11:30:24,114 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:24,121 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 235 statements into 2 equivalence classes. [2025-03-04 11:30:24,128 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 119 of 235 statements. [2025-03-04 11:30:24,128 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:30:24,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 1265 proven. 112 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2025-03-04 11:30:24,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269089080] [2025-03-04 11:30:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269089080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905993823] [2025-03-04 11:30:24,727 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:24,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:24,730 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:30:24,731 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:30:24,812 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 235 statements into 2 equivalence classes. [2025-03-04 11:30:24,829 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 119 of 235 statements. [2025-03-04 11:30:24,829 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:30:24,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:24,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 11:30:24,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 1265 proven. 112 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2025-03-04 11:30:25,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 1265 proven. 1058 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-04 11:31:04,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905993823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:04,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:04,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 51] total 55 [2025-03-04 11:31:04,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47688566] [2025-03-04 11:31:04,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:04,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 11:31:04,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:04,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 11:31:04,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=2291, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:31:04,112 INFO L87 Difference]: Start difference. First operand 429 states and 449 transitions. Second operand has 55 states, 53 states have (on average 3.7358490566037736) internal successors, (198), 53 states have internal predecessors, (198), 27 states have call successors, (27), 3 states have call predecessors, (27), 23 states have return successors, (46), 23 states have call predecessors, (46), 25 states have call successors, (46) [2025-03-04 11:31:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:04,231 INFO L93 Difference]: Finished difference Result 429 states and 449 transitions. [2025-03-04 11:31:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:31:04,234 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 3.7358490566037736) internal successors, (198), 53 states have internal predecessors, (198), 27 states have call successors, (27), 3 states have call predecessors, (27), 23 states have return successors, (46), 23 states have call predecessors, (46), 25 states have call successors, (46) Word has length 235 [2025-03-04 11:31:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:04,234 INFO L225 Difference]: With dead ends: 429 [2025-03-04 11:31:04,235 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:31:04,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 443 SyntacticMatches, 23 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=905, Invalid=2877, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 11:31:04,237 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:04,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 222 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:31:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:31:04,238 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:31:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:31:04,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 235 [2025-03-04 11:31:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:04,239 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:31:04,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 3.7358490566037736) internal successors, (198), 53 states have internal predecessors, (198), 27 states have call successors, (27), 3 states have call predecessors, (27), 23 states have return successors, (46), 23 states have call predecessors, (46), 25 states have call successors, (46) [2025-03-04 11:31:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:31:04,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:31:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-04 11:31:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-04 11:31:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-04 11:31:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-04 11:31:04,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:04,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:04,449 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2025-03-04 11:31:04,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:31:05,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:31:05,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:31:05 BoogieIcfgContainer [2025-03-04 11:31:05,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:31:05,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:31:05,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:31:05,114 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:31:05,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:14" (3/4) ... [2025-03-04 11:31:05,115 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:31:05,119 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id [2025-03-04 11:31:05,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:31:05,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:31:05,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:31:05,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:31:05,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:31:05,170 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:31:05,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:31:05,170 INFO L158 Benchmark]: Toolchain (without parser) took 50658.88ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 123.9MB in the beginning and 135.1MB in the end (delta: -11.2MB). Peak memory consumption was 171.6MB. Max. memory is 16.1GB. [2025-03-04 11:31:05,170 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:31:05,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.97ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 113.1MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:31:05,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.98ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 112.2MB in the end (delta: 905.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:31:05,171 INFO L158 Benchmark]: Boogie Preprocessor took 20.19ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.3MB in the end (delta: 929.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:31:05,171 INFO L158 Benchmark]: IcfgBuilder took 188.23ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 101.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:31:05,171 INFO L158 Benchmark]: TraceAbstraction took 50234.10ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 100.9MB in the beginning and 143.4MB in the end (delta: -42.5MB). Peak memory consumption was 188.4MB. Max. memory is 16.1GB. [2025-03-04 11:31:05,171 INFO L158 Benchmark]: Witness Printer took 56.12ms. Allocated memory is still 352.3MB. Free memory was 143.4MB in the beginning and 135.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:31:05,172 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.97ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 113.1MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.98ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 112.2MB in the end (delta: 905.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.19ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.3MB in the end (delta: 929.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 188.23ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 101.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50234.10ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 100.9MB in the beginning and 143.4MB in the end (delta: -42.5MB). Peak memory consumption was 188.4MB. Max. memory is 16.1GB. * Witness Printer took 56.12ms. Allocated memory is still 352.3MB. Free memory was 143.4MB in the beginning and 135.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: 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, 24 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 49.5s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 586 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 583 mSDsluCounter, 1126 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 939 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 724 IncrementalHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 187 mSDtfsCounter, 724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1237 GetRequests, 966 SyntacticMatches, 23 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3348 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=10, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 46.2s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1645 ConstructedInterpolants, 0 QuantifiedInterpolants, 4603 SizeOfPredicates, 41 NumberOfNonLiveVariables, 907 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 7719/10891 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 11:31:05,195 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