./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/CWE190_Integer_Overflow__int_fscanf_multiply_17_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 4e858e92769826ad06862da6c445d838ea78539ebefca17b20a88b6678436e7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 17:00:09,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 17:00:09,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 17:00:09,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 17:00:09,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 17:00:09,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 17:00:09,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 17:00:09,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 17:00:09,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 17:00:09,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 17:00:09,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 17:00:09,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 17:00:09,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 17:00:09,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 17:00:09,558 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 17:00:09,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 17:00:09,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 17:00:09,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 17:00:09,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 17:00:09,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 17:00:09,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 17:00:09,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 17:00:09,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 17:00:09,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 17:00:09,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 17:00:09,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 17:00:09,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 17:00:09,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 17:00:09,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 17:00:09,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 17:00:09,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 17:00:09,561 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 -> 4e858e92769826ad06862da6c445d838ea78539ebefca17b20a88b6678436e7e [2025-03-17 17:00:09,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 17:00:09,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 17:00:09,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 17:00:09,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 17:00:09,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 17:00:09,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_17_good.i [2025-03-17 17:00:10,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12518fe2/14363c9ff9c2469bba1ada3240662c7f/FLAG9c47f1a46 [2025-03-17 17:00:11,258 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 17:00:11,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_17_good.i [2025-03-17 17:00:11,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12518fe2/14363c9ff9c2469bba1ada3240662c7f/FLAG9c47f1a46 [2025-03-17 17:00:11,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12518fe2/14363c9ff9c2469bba1ada3240662c7f [2025-03-17 17:00:11,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 17:00:11,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 17:00:11,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 17:00:11,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 17:00:11,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 17:00:11,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:00:11" (1/1) ... [2025-03-17 17:00:11,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d17ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:11, skipping insertion in model container [2025-03-17 17:00:11,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:00:11" (1/1) ... [2025-03-17 17:00:11,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 17:00:12,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 17:00:12,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 17:00:12,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 17:00:12,328 INFO L204 MainTranslator]: Completed translation [2025-03-17 17:00:12,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12 WrapperNode [2025-03-17 17:00:12,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 17:00:12,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 17:00:12,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 17:00:12,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 17:00:12,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,370 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2025-03-17 17:00:12,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 17:00:12,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 17:00:12,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 17:00:12,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 17:00:12,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,384 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 17:00:12,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 17:00:12,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 17:00:12,396 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 17:00:12,396 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 17:00:12,397 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (1/1) ... [2025-03-17 17:00:12,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 17:00:12,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:00:12,424 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-17 17:00:12,430 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-17 17:00:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 17:00:12,447 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 17:00:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 17:00:12,447 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 17:00:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 17:00:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 17:00:12,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 17:00:12,566 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 17:00:12,567 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 17:00:12,702 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-17 17:00:12,702 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 17:00:12,709 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 17:00:12,709 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 17:00:12,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:00:12 BoogieIcfgContainer [2025-03-17 17:00:12,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 17:00:12,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 17:00:12,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 17:00:12,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 17:00:12,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:00:11" (1/3) ... [2025-03-17 17:00:12,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d3e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:00:12, skipping insertion in model container [2025-03-17 17:00:12,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:00:12" (2/3) ... [2025-03-17 17:00:12,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d3e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:00:12, skipping insertion in model container [2025-03-17 17:00:12,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:00:12" (3/3) ... [2025-03-17 17:00:12,718 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_multiply_17_good.i [2025-03-17 17:00:12,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 17:00:12,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fscanf_multiply_17_good.i that has 3 procedures, 52 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-17 17:00:12,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 17:00:12,778 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;@47a804c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 17:00:12,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-17 17:00:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.625) internal successors, (52), 45 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 17:00:12,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 17:00:12,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:12,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:12,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:12,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1723909652, now seen corresponding path program 1 times [2025-03-17 17:00:12,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343685885] [2025-03-17 17:00:12,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:12,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 17:00:12,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 17:00:12,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:12,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:13,025 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-17 17:00:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343685885] [2025-03-17 17:00:13,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343685885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:13,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:00:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:00:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255403637] [2025-03-17 17:00:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:13,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:00:13,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:13,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:00:13,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:00:13,044 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.625) internal successors, (52), 45 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-17 17:00:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:13,077 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2025-03-17 17:00:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:00:13,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2025-03-17 17:00:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:13,083 INFO L225 Difference]: With dead ends: 101 [2025-03-17 17:00:13,083 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 17:00:13,086 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-17 17:00:13,091 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:13,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 17:00:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 17:00:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 45 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:00:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-03-17 17:00:13,126 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 9 [2025-03-17 17:00:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:13,127 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-03-17 17:00:13,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-17 17:00:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2025-03-17 17:00:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 17:00:13,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:13,128 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:13,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 17:00:13,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:13,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2068466460, now seen corresponding path program 1 times [2025-03-17 17:00:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778849877] [2025-03-17 17:00:13,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:13,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 17:00:13,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 17:00:13,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:13,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 17:00:13,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:13,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778849877] [2025-03-17 17:00:13,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778849877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:00:13,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89671276] [2025-03-17 17:00:13,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:13,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:00:13,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:00:13,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 17:00:13,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 17:00:13,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 17:00:13,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 17:00:13,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:13,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:13,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 17:00:13,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:00:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 17:00:13,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:00:13,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89671276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:13,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:00:13,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 17:00:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880029833] [2025-03-17 17:00:13,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:13,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 17:00:13,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:13,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 17:00:13,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 17:00:13,379 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-17 17:00:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:13,398 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2025-03-17 17:00:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 17:00:13,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-17 17:00:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:13,400 INFO L225 Difference]: With dead ends: 92 [2025-03-17 17:00:13,401 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 17:00:13,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 17:00:13,402 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:13,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 17:00:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 17:00:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 41 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:00:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-17 17:00:13,406 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 12 [2025-03-17 17:00:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:13,406 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-17 17:00:13,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-17 17:00:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-17 17:00:13,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 17:00:13,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:13,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:13,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 17:00:13,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:00:13,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:13,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash 773420786, now seen corresponding path program 1 times [2025-03-17 17:00:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195169373] [2025-03-17 17:00:13,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:13,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:13,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 17:00:13,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 17:00:13,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:13,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 17:00:13,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:13,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195169373] [2025-03-17 17:00:13,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195169373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:13,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:00:13,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:00:13,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486137315] [2025-03-17 17:00:13,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:13,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:00:13,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:13,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:00:13,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:00:13,650 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-17 17:00:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:13,660 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-03-17 17:00:13,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:00:13,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-03-17 17:00:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:13,661 INFO L225 Difference]: With dead ends: 79 [2025-03-17 17:00:13,661 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 17:00:13,661 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-17 17:00:13,662 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:13,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 17:00:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2025-03-17 17:00:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.5) internal successors, (48), 42 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:00:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-17 17:00:13,666 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 14 [2025-03-17 17:00:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:13,666 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-17 17:00:13,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-17 17:00:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-17 17:00:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 17:00:13,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:13,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:13,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 17:00:13,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1793237082, now seen corresponding path program 1 times [2025-03-17 17:00:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:13,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627184941] [2025-03-17 17:00:13,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:13,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 17:00:13,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 17:00:13,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:13,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 17:00:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627184941] [2025-03-17 17:00:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627184941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:13,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:00:13,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:00:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475078123] [2025-03-17 17:00:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:13,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:00:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:13,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:00:13,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:00:13,695 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-17 17:00:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:13,712 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2025-03-17 17:00:13,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:00:13,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 15 [2025-03-17 17:00:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:13,712 INFO L225 Difference]: With dead ends: 94 [2025-03-17 17:00:13,713 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 17:00:13,713 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-17 17:00:13,713 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:13,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 17:00:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-17 17:00:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 46 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:00:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-03-17 17:00:13,717 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 15 [2025-03-17 17:00:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:13,717 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-17 17:00:13,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-17 17:00:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-03-17 17:00:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 17:00:13,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:13,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 17:00:13,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1793236376, now seen corresponding path program 1 times [2025-03-17 17:00:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995915155] [2025-03-17 17:00:13,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:13,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 17:00:13,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 17:00:13,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:13,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 17:00:13,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995915155] [2025-03-17 17:00:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995915155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:13,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:00:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:00:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975709846] [2025-03-17 17:00:13,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:00:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:00:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:00:13,763 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-17 17:00:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:13,783 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2025-03-17 17:00:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:00:13,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2025-03-17 17:00:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:13,784 INFO L225 Difference]: With dead ends: 68 [2025-03-17 17:00:13,784 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 17:00:13,785 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-17 17:00:13,785 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:13,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 143 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 17:00:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-03-17 17:00:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.4375) internal successors, (69), 58 states have internal predecessors, (69), 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-17 17:00:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-03-17 17:00:13,789 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 15 [2025-03-17 17:00:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:13,790 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-17 17:00:13,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-17 17:00:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2025-03-17 17:00:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 17:00:13,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:13,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:13,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 17:00:13,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:13,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash 244225313, now seen corresponding path program 1 times [2025-03-17 17:00:13,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:13,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319122738] [2025-03-17 17:00:13,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:13,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:13,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 17:00:13,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 17:00:13,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:13,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 17:00:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319122738] [2025-03-17 17:00:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319122738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:00:13,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:00:13,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262130179] [2025-03-17 17:00:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:13,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:00:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:13,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:00:13,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:00:13,825 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-17 17:00:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:13,849 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2025-03-17 17:00:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:00:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2025-03-17 17:00:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:13,850 INFO L225 Difference]: With dead ends: 114 [2025-03-17 17:00:13,850 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 17:00:13,850 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-17 17:00:13,851 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:13,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 17:00:13,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-17 17:00:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 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-17 17:00:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-03-17 17:00:13,856 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 16 [2025-03-17 17:00:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:13,856 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-17 17:00:13,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-17 17:00:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-03-17 17:00:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 17:00:13,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:13,857 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-17 17:00:13,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 17:00:13,857 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:13,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash 693496421, now seen corresponding path program 1 times [2025-03-17 17:00:13,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:13,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533823092] [2025-03-17 17:00:13,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:13,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:13,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 17:00:13,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 17:00:13,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:13,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 17:00:13,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:13,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533823092] [2025-03-17 17:00:13,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533823092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:13,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:00:13,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:00:13,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580245037] [2025-03-17 17:00:13,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:13,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:00:13,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:13,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:00:13,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:00:13,920 INFO L87 Difference]: Start difference. First operand 73 states and 91 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-17 17:00:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:13,933 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2025-03-17 17:00:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:00:13,934 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-17 17:00:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:13,934 INFO L225 Difference]: With dead ends: 94 [2025-03-17 17:00:13,934 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 17:00:13,934 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-17 17:00:13,935 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:13,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 17:00:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 17:00:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 67 states have internal predecessors, (82), 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-17 17:00:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2025-03-17 17:00:13,939 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 19 [2025-03-17 17:00:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:13,939 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2025-03-17 17:00:13,940 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-17 17:00:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2025-03-17 17:00:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 17:00:13,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:13,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:13,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 17:00:13,940 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:13,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash 24075605, now seen corresponding path program 1 times [2025-03-17 17:00:13,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:13,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839501761] [2025-03-17 17:00:13,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:13,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:13,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 17:00:13,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 17:00:13,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:13,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 17:00:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:13,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839501761] [2025-03-17 17:00:13,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839501761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:00:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273313490] [2025-03-17 17:00:13,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:13,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:00:13,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:00:13,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 17:00:13,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 17:00:14,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 17:00:14,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 17:00:14,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:14,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:14,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 17:00:14,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:00:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 17:00:14,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:00:14,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273313490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:14,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:00:14,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 17:00:14,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112565983] [2025-03-17 17:00:14,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:14,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 17:00:14,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:14,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 17:00:14,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 17:00:14,068 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-17 17:00:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:14,088 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2025-03-17 17:00:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 17:00:14,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2025-03-17 17:00:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:14,090 INFO L225 Difference]: With dead ends: 107 [2025-03-17 17:00:14,090 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 17:00:14,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 17:00:14,091 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:14,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 133 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 17:00:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2025-03-17 17:00:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 41 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:00:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2025-03-17 17:00:14,094 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2025-03-17 17:00:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:14,094 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-03-17 17:00:14,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-17 17:00:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2025-03-17 17:00:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 17:00:14,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:14,095 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:14,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 17:00:14,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 17:00:14,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:14,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1159178419, now seen corresponding path program 1 times [2025-03-17 17:00:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469440309] [2025-03-17 17:00:14,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:14,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 17:00:14,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 17:00:14,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:14,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 17:00:14,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469440309] [2025-03-17 17:00:14,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469440309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:00:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090410576] [2025-03-17 17:00:14,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:14,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:00:14,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:00:14,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 17:00:14,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 17:00:14,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 17:00:14,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 17:00:14,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:14,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:14,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 17:00:14,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:00:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 17:00:14,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:00:14,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090410576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:14,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:00:14,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 17:00:14,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703219904] [2025-03-17 17:00:14,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:14,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 17:00:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:14,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 17:00:14,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 17:00:14,431 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-17 17:00:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:14,439 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-03-17 17:00:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 17:00:14,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2025-03-17 17:00:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:14,440 INFO L225 Difference]: With dead ends: 64 [2025-03-17 17:00:14,440 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 17:00:14,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 17:00:14,440 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:14,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 17:00:14,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 17:00:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 37 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:00:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-17 17:00:14,444 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2025-03-17 17:00:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:14,444 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-17 17:00:14,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-17 17:00:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-17 17:00:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 17:00:14,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:14,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:14,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 17:00:14,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:00:14,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:14,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:14,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1573777874, now seen corresponding path program 1 times [2025-03-17 17:00:14,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:14,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19494018] [2025-03-17 17:00:14,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:14,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:14,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 17:00:14,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 17:00:14,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:14,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 17:00:14,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:14,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19494018] [2025-03-17 17:00:14,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19494018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:14,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:00:14,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:00:14,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939576304] [2025-03-17 17:00:14,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:14,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:00:14,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:14,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:00:14,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:00:14,679 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (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-17 17:00:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:14,689 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-03-17 17:00:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:00:14,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (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 24 [2025-03-17 17:00:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:14,690 INFO L225 Difference]: With dead ends: 57 [2025-03-17 17:00:14,690 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 17:00:14,691 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-17 17:00:14,691 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:14,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 17:00:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 17:00:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 17:00:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-03-17 17:00:14,695 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 24 [2025-03-17 17:00:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:14,695 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-03-17 17:00:14,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (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-17 17:00:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-03-17 17:00:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 17:00:14,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:14,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:14,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 17:00:14,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:14,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1870879534, now seen corresponding path program 1 times [2025-03-17 17:00:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:14,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825383095] [2025-03-17 17:00:14,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:14,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:14,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 17:00:14,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 17:00:14,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:14,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 17:00:14,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:14,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825383095] [2025-03-17 17:00:14,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825383095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:14,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:00:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:00:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391447228] [2025-03-17 17:00:14,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:14,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:00:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:14,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:00:14,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:00:14,751 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 17:00:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:14,771 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-03-17 17:00:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:00:14,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-03-17 17:00:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:14,772 INFO L225 Difference]: With dead ends: 52 [2025-03-17 17:00:14,773 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 17:00:14,773 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-17 17:00:14,773 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:14,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 17:00:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 17:00:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 17:00:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-17 17:00:14,783 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 32 [2025-03-17 17:00:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-17 17:00:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 17:00:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-17 17:00:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 17:00:14,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:00:14,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:14,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 17:00:14,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-17 17:00:14,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:00:14,784 INFO L85 PathProgramCache]: Analyzing trace with hash 220568437, now seen corresponding path program 1 times [2025-03-17 17:00:14,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:00:14,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285995443] [2025-03-17 17:00:14,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:14,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:00:14,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 17:00:14,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 17:00:14,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:14,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 17:00:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:00:14,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285995443] [2025-03-17 17:00:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285995443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:00:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301214173] [2025-03-17 17:00:14,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:00:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:00:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:00:14,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 17:00:14,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 17:00:14,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 17:00:14,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 17:00:14,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:00:14,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:00:14,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 17:00:14,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:00:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 17:00:15,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:00:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301214173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:00:15,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:00:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 17:00:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721118568] [2025-03-17 17:00:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:00:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 17:00:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:00:15,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 17:00:15,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 17:00:15,006 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 17:00:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:00:15,026 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-03-17 17:00:15,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 17:00:15,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2025-03-17 17:00:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:00:15,027 INFO L225 Difference]: With dead ends: 54 [2025-03-17 17:00:15,027 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 17:00:15,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 17:00:15,029 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:00:15,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:00:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 17:00:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 17:00:15,030 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-17 17:00:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 17:00:15,030 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2025-03-17 17:00:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:00:15,030 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 17:00:15,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 17:00:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 17:00:15,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-17 17:00:15,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-17 17:00:15,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 17:00:15,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:00:15,237 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:00:15,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 17:00:15,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 17:00:15,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:00:15 BoogieIcfgContainer [2025-03-17 17:00:15,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 17:00:15,329 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 17:00:15,329 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 17:00:15,329 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 17:00:15,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:00:12" (3/4) ... [2025-03-17 17:00:15,331 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 17:00:15,335 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 17:00:15,336 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 17:00:15,339 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 17:00:15,340 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 17:00:15,340 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 17:00:15,400 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 17:00:15,400 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 17:00:15,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 17:00:15,401 INFO L158 Benchmark]: Toolchain (without parser) took 3869.15ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 103.0MB in the end (delta: 27.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-03-17 17:00:15,402 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:00:15,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 796.88ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 70.7MB in the end (delta: 60.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 17:00:15,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.12ms. Allocated memory is still 167.8MB. Free memory was 70.7MB in the beginning and 68.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 17:00:15,403 INFO L158 Benchmark]: Boogie Preprocessor took 21.94ms. Allocated memory is still 167.8MB. Free memory was 67.8MB in the beginning and 66.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:00:15,403 INFO L158 Benchmark]: IcfgBuilder took 313.80ms. Allocated memory is still 167.8MB. Free memory was 66.4MB in the beginning and 51.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 17:00:15,403 INFO L158 Benchmark]: TraceAbstraction took 2617.43ms. Allocated memory is still 167.8MB. Free memory was 51.4MB in the beginning and 109.4MB in the end (delta: -58.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:00:15,404 INFO L158 Benchmark]: Witness Printer took 71.24ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 103.0MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 17:00:15,405 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 796.88ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 70.7MB in the end (delta: 60.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.12ms. Allocated memory is still 167.8MB. Free memory was 70.7MB in the beginning and 68.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.94ms. Allocated memory is still 167.8MB. Free memory was 67.8MB in the beginning and 66.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 313.80ms. Allocated memory is still 167.8MB. Free memory was 66.4MB in the beginning and 51.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2617.43ms. Allocated memory is still 167.8MB. Free memory was 51.4MB in the beginning and 109.4MB in the end (delta: -58.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 71.24ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 103.0MB in the end (delta: 6.4MB). 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: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: 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: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: 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, 52 locations, 67 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 1509 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 922 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 587 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=7, InterpolantAutomatonStates: 48, 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, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 58/62 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 12 specifications checked. All of them hold - InvariantResult [Line: 1553]: Location Invariant Derived location invariant: (((i == 0) && (data <= 1073741822)) || (0 < i)) - InvariantResult [Line: 1557]: Location Invariant Derived location invariant: ((k == 0) || (1 <= k)) - InvariantResult [Line: 1582]: Location Invariant Derived location invariant: (((1 <= j) && (data == 2)) || ((j == 0) && (data == 2))) - InvariantResult [Line: 1578]: Location Invariant Derived location invariant: (((1 <= h) && (data == 2)) || (h == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-17 17:00:15,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE