./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_03_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_03_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 2d5a928396209f6afbe052db99b548634822ad989fb038e22efdc46c01ec1641 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:36:01,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:36:01,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:36:01,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:36:01,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:36:01,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:36:01,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:36:01,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:36:01,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:36:01,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:36:01,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:36:01,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:36:01,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:36:01,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:36:01,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:36:01,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:36:01,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:36:01,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:36:01,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:36:01,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:36:01,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:36:01,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:36:01,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:36:01,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:36:01,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:36:01,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:36:01,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:36:01,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:36:01,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:36:01,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:36:01,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:36:01,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:36:01,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:36:01,674 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d5a928396209f6afbe052db99b548634822ad989fb038e22efdc46c01ec1641 [2025-03-04 14:36:01,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:36:01,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:36:01,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:36:01,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:36:01,942 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:36:01,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_03_good.i [2025-03-04 14:36:03,085 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b159338f/a8d3d0e5b5f143bd85a6af1fbac554ba/FLAG43e2e1757 [2025-03-04 14:36:03,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:36:03,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_03_good.i [2025-03-04 14:36:03,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b159338f/a8d3d0e5b5f143bd85a6af1fbac554ba/FLAG43e2e1757 [2025-03-04 14:36:03,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b159338f/a8d3d0e5b5f143bd85a6af1fbac554ba [2025-03-04 14:36:03,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:36:03,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:36:03,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:36:03,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:36:03,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:36:03,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:36:03" (1/1) ... [2025-03-04 14:36:03,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b6f424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:03, skipping insertion in model container [2025-03-04 14:36:03,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:36:03" (1/1) ... [2025-03-04 14:36:03,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:36:04,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:36:04,290 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:36:04,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:36:04,436 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:36:04,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04 WrapperNode [2025-03-04 14:36:04,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:36:04,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:36:04,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:36:04,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:36:04,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,479 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 205 [2025-03-04 14:36:04,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:36:04,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:36:04,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:36:04,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:36:04,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,511 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 14:36:04,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:36:04,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:36:04,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:36:04,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:36:04,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (1/1) ... [2025-03-04 14:36:04,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:36:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:04,564 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 14:36:04,567 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 14:36:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 14:36:04,585 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 14:36:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 14:36:04,585 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 14:36:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:36:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:36:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:36:04,710 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:36:04,712 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:36:05,019 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-04 14:36:05,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:36:05,046 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:36:05,049 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:36:05,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:36:05 BoogieIcfgContainer [2025-03-04 14:36:05,049 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:36:05,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:36:05,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:36:05,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:36:05,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:36:03" (1/3) ... [2025-03-04 14:36:05,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497eb6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:36:05, skipping insertion in model container [2025-03-04 14:36:05,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:04" (2/3) ... [2025-03-04 14:36:05,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497eb6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:36:05, skipping insertion in model container [2025-03-04 14:36:05,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:36:05" (3/3) ... [2025-03-04 14:36:05,058 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_03_good.i [2025-03-04 14:36:05,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:36:05,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_postdec_03_good.i that has 3 procedures, 103 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 14:36:05,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:36:05,135 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;@1602ecb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:36:05,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 14:36:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 82 states have (on average 1.548780487804878) internal successors, (127), 94 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 14:36:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:36:05,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:05,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:05,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:05,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash -703880865, now seen corresponding path program 1 times [2025-03-04 14:36:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509225115] [2025-03-04 14:36:05,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:05,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:05,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:36:05,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:36:05,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:05,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:05,280 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 14:36:05,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:05,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509225115] [2025-03-04 14:36:05,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509225115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:05,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:05,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:36:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374665447] [2025-03-04 14:36:05,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:05,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:36:05,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:05,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:36:05,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:36:05,302 INFO L87 Difference]: Start difference. First operand has 103 states, 82 states have (on average 1.548780487804878) internal successors, (127), 94 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:36:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:05,343 INFO L93 Difference]: Finished difference Result 177 states and 248 transitions. [2025-03-04 14:36:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:36:05,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 14:36:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:05,350 INFO L225 Difference]: With dead ends: 177 [2025-03-04 14:36:05,350 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 14:36:05,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:36:05,354 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:05,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 14:36:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 14:36:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 85 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:36:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2025-03-04 14:36:05,382 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 12 [2025-03-04 14:36:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:05,383 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2025-03-04 14:36:05,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:36:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2025-03-04 14:36:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 14:36:05,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:05,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:05,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:36:05,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:05,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1875977457, now seen corresponding path program 1 times [2025-03-04 14:36:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:05,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49174701] [2025-03-04 14:36:05,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:05,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 14:36:05,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 14:36:05,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:05,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:05,511 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 14:36:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49174701] [2025-03-04 14:36:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49174701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:36:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330875756] [2025-03-04 14:36:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:05,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:05,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:05,514 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:36:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:05,541 INFO L93 Difference]: Finished difference Result 92 states and 124 transitions. [2025-03-04 14:36:05,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:05,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 14:36:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:05,543 INFO L225 Difference]: With dead ends: 92 [2025-03-04 14:36:05,543 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 14:36:05,543 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 14:36:05,544 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:05,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 221 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 14:36:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 14:36:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 84 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:36:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-03-04 14:36:05,550 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 18 [2025-03-04 14:36:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:05,550 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-03-04 14:36:05,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:36:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-03-04 14:36:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 14:36:05,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:05,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 14:36:05,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1974240916, now seen corresponding path program 1 times [2025-03-04 14:36:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:05,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60923159] [2025-03-04 14:36:05,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:05,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 14:36:05,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 14:36:05,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:05,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:05,691 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 14:36:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:05,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60923159] [2025-03-04 14:36:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60923159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:36:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463250569] [2025-03-04 14:36:05,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:05,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:36:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:05,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:36:05,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:05,694 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:36:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:05,734 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2025-03-04 14:36:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:36:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-04 14:36:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:05,735 INFO L225 Difference]: With dead ends: 91 [2025-03-04 14:36:05,735 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 14:36:05,735 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 14:36:05,736 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 35 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 293 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 14:36:05,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 293 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 14:36:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-04 14:36:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 83 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:36:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2025-03-04 14:36:05,741 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 19 [2025-03-04 14:36:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:05,741 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2025-03-04 14:36:05,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:36:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2025-03-04 14:36:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 14:36:05,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:05,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:05,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:36:05,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:05,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:05,743 INFO L85 PathProgramCache]: Analyzing trace with hash 110300557, now seen corresponding path program 1 times [2025-03-04 14:36:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:05,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805004068] [2025-03-04 14:36:05,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:05,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 14:36:05,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 14:36:05,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:05,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:36:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805004068] [2025-03-04 14:36:05,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805004068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:05,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:05,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:36:05,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572710719] [2025-03-04 14:36:05,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:05,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:05,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:05,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:05,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:05,880 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:36:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:05,909 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-03-04 14:36:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:05,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-04 14:36:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:05,911 INFO L225 Difference]: With dead ends: 90 [2025-03-04 14:36:05,912 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 14:36:05,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:05,912 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:05,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 217 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:05,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 14:36:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-04 14:36:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 82 states have internal predecessors, (109), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:36:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-03-04 14:36:05,925 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 33 [2025-03-04 14:36:05,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:05,925 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-03-04 14:36:05,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:36:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-03-04 14:36:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 14:36:05,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:05,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:05,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:36:05,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:05,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash -875650022, now seen corresponding path program 1 times [2025-03-04 14:36:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:05,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286202286] [2025-03-04 14:36:05,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:05,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:05,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 14:36:05,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 14:36:05,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:05,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:36:06,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:06,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286202286] [2025-03-04 14:36:06,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286202286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:06,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:06,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:36:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969557827] [2025-03-04 14:36:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:06,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:36:06,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:06,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:36:06,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:06,019 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:36:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:06,064 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2025-03-04 14:36:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:36:06,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-03-04 14:36:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:06,065 INFO L225 Difference]: With dead ends: 89 [2025-03-04 14:36:06,065 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 14:36:06,066 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 14:36:06,068 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 35 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 287 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 14:36:06,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 287 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 14:36:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 14:36:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 81 states have internal predecessors, (108), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:36:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2025-03-04 14:36:06,076 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 34 [2025-03-04 14:36:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:06,076 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2025-03-04 14:36:06,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:36:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2025-03-04 14:36:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 14:36:06,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:06,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:06,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:36:06,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:06,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash -602825388, now seen corresponding path program 1 times [2025-03-04 14:36:06,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:06,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416826657] [2025-03-04 14:36:06,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:06,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 14:36:06,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 14:36:06,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:06,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 14:36:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416826657] [2025-03-04 14:36:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416826657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:06,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:36:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073073038] [2025-03-04 14:36:06,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:06,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:36:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:06,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:36:06,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:06,134 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 14:36:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:06,166 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2025-03-04 14:36:06,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:36:06,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-04 14:36:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:06,168 INFO L225 Difference]: With dead ends: 88 [2025-03-04 14:36:06,169 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 14:36:06,169 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 14:36:06,169 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:06,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 316 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 14:36:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-04 14:36:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 80 states have internal predecessors, (107), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:36:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-03-04 14:36:06,174 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 41 [2025-03-04 14:36:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:06,174 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-03-04 14:36:06,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 14:36:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-03-04 14:36:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 14:36:06,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:06,175 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:06,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:36:06,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:06,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1507717849, now seen corresponding path program 1 times [2025-03-04 14:36:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:06,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950227057] [2025-03-04 14:36:06,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:06,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 14:36:06,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 14:36:06,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:06,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 14:36:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950227057] [2025-03-04 14:36:06,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950227057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:06,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:06,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:36:06,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904181979] [2025-03-04 14:36:06,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:06,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:36:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:06,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:36:06,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:06,235 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 14:36:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:06,264 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2025-03-04 14:36:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:36:06,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-04 14:36:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:06,265 INFO L225 Difference]: With dead ends: 87 [2025-03-04 14:36:06,265 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 14:36:06,266 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 14:36:06,267 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:06,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 14:36:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 14:36:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.394736842105263) internal successors, (106), 79 states have internal predecessors, (106), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:36:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2025-03-04 14:36:06,275 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 42 [2025-03-04 14:36:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:06,276 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2025-03-04 14:36:06,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 14:36:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2025-03-04 14:36:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 14:36:06,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:06,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:06,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:36:06,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:06,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:06,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1462078514, now seen corresponding path program 1 times [2025-03-04 14:36:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:06,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065275633] [2025-03-04 14:36:06,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:06,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:06,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:36:06,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:36:06,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:06,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:06,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 14:36:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:06,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065275633] [2025-03-04 14:36:06,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065275633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:06,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:06,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:36:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010283905] [2025-03-04 14:36:06,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:06,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:36:06,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:06,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:36:06,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:06,341 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:36:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:06,366 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2025-03-04 14:36:06,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:36:06,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2025-03-04 14:36:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:06,368 INFO L225 Difference]: With dead ends: 86 [2025-03-04 14:36:06,368 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 14:36:06,369 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 14:36:06,369 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:06,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 315 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 14:36:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 14:36:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.381578947368421) internal successors, (105), 78 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:36:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2025-03-04 14:36:06,375 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 51 [2025-03-04 14:36:06,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:06,376 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2025-03-04 14:36:06,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:36:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2025-03-04 14:36:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 14:36:06,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:06,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:06,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:36:06,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:06,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1920206306, now seen corresponding path program 1 times [2025-03-04 14:36:06,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:06,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146612985] [2025-03-04 14:36:06,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:06,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:06,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 14:36:06,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 14:36:06,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:06,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 14:36:06,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:06,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146612985] [2025-03-04 14:36:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146612985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:06,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:36:06,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153942022] [2025-03-04 14:36:06,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:06,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:36:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:06,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:36:06,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:06,468 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:36:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:06,491 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2025-03-04 14:36:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:36:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2025-03-04 14:36:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:06,492 INFO L225 Difference]: With dead ends: 85 [2025-03-04 14:36:06,492 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 14:36:06,492 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 14:36:06,493 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:06,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 14:36:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 14:36:06,495 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 14:36:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 14:36:06,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2025-03-04 14:36:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:06,495 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 14:36:06,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:36:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 14:36:06,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 14:36:06,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 14:36:06,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 14:36:06,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 14:36:06,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 14:36:06,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 14:36:06,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 14:36:06,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 14:36:06,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 14:36:06,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:36:06,502 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:06,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 14:36:06,521 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:36:06,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:36:06 BoogieIcfgContainer [2025-03-04 14:36:06,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:36:06,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:36:06,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:36:06,528 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:36:06,528 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:36:05" (3/4) ... [2025-03-04 14:36:06,531 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 14:36:06,535 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 14:36:06,535 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 14:36:06,541 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 14:36:06,541 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 14:36:06,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 14:36:06,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 14:36:06,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 14:36:06,611 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 14:36:06,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:36:06,611 INFO L158 Benchmark]: Toolchain (without parser) took 2960.24ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 105.7MB in the end (delta: 14.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-04 14:36:06,612 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:36:06,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 784.94ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 59.6MB in the end (delta: 60.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 14:36:06,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.75ms. Allocated memory is still 167.8MB. Free memory was 58.9MB in the beginning and 55.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:36:06,613 INFO L158 Benchmark]: Boogie Preprocessor took 50.36ms. Allocated memory is still 167.8MB. Free memory was 55.9MB in the beginning and 54.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:36:06,613 INFO L158 Benchmark]: IcfgBuilder took 518.37ms. Allocated memory is still 167.8MB. Free memory was 54.4MB in the beginning and 113.7MB in the end (delta: -59.4MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2025-03-04 14:36:06,613 INFO L158 Benchmark]: TraceAbstraction took 1476.18ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 112.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:36:06,613 INFO L158 Benchmark]: Witness Printer took 83.13ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 105.7MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:36:06,615 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 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 784.94ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 59.6MB in the end (delta: 60.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.75ms. Allocated memory is still 167.8MB. Free memory was 58.9MB in the beginning and 55.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.36ms. Allocated memory is still 167.8MB. Free memory was 55.9MB in the beginning and 54.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 518.37ms. Allocated memory is still 167.8MB. Free memory was 54.4MB in the beginning and 113.7MB in the end (delta: -59.4MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1476.18ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 112.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 83.13ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 105.7MB in the end (delta: 7.0MB). 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: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: 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 3 procedures, 103 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 2407 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1414 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 254 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 993 mSDtfsCounter, 254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 56/56 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 14:36:06,629 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