./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_08_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_max_multiply_08_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 765d2d340527896dc3fb4c15c0374e596fc1004c6522b141fa37aab48932aa14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 17:39:15,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 17:39:15,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 17:39:15,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 17:39:15,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 17:39:15,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 17:39:15,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 17:39:15,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 17:39:15,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 17:39:15,611 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 17:39:15,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 17:39:15,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 17:39:15,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 17:39:15,612 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 17:39:15,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 17:39:15,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 17:39:15,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 17:39:15,613 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 -> 765d2d340527896dc3fb4c15c0374e596fc1004c6522b141fa37aab48932aa14 [2025-03-17 17:39:15,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 17:39:15,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 17:39:15,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 17:39:15,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 17:39:15,879 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 17:39:15,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_max_multiply_08_good.i [2025-03-17 17:39:17,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d74fe9e3/120d645e793f48dcbc84b8081f192f0c/FLAG183661c10 [2025-03-17 17:39:17,413 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 17:39:17,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_08_good.i [2025-03-17 17:39:17,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d74fe9e3/120d645e793f48dcbc84b8081f192f0c/FLAG183661c10 [2025-03-17 17:39:17,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d74fe9e3/120d645e793f48dcbc84b8081f192f0c [2025-03-17 17:39:17,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 17:39:17,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 17:39:17,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 17:39:17,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 17:39:17,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 17:39:17,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:39:17" (1/1) ... [2025-03-17 17:39:17,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68efda93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:17, skipping insertion in model container [2025-03-17 17:39:17,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:39:17" (1/1) ... [2025-03-17 17:39:17,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 17:39:18,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 17:39:18,242 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 17:39:18,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 17:39:18,403 INFO L204 MainTranslator]: Completed translation [2025-03-17 17:39:18,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18 WrapperNode [2025-03-17 17:39:18,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 17:39:18,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 17:39:18,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 17:39:18,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 17:39:18,409 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:39:18" (1/1) ... [2025-03-17 17:39:18,423 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:39:18" (1/1) ... [2025-03-17 17:39:18,444 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 113 [2025-03-17 17:39:18,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 17:39:18,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 17:39:18,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 17:39:18,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 17:39:18,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,460 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 17:39:18,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 17:39:18,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 17:39:18,471 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 17:39:18,471 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 17:39:18,472 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (1/1) ... [2025-03-17 17:39:18,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 17:39:18,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:39:18,494 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:39:18,498 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:39:18,511 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 17:39:18,512 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 17:39:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 17:39:18,512 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 17:39:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 17:39:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 17:39:18,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 17:39:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-03-17 17:39:18,512 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-03-17 17:39:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2025-03-17 17:39:18,512 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2025-03-17 17:39:18,596 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 17:39:18,598 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 17:39:18,740 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-17 17:39:18,740 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 17:39:18,748 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 17:39:18,748 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 17:39:18,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:39:18 BoogieIcfgContainer [2025-03-17 17:39:18,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 17:39:18,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 17:39:18,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 17:39:18,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 17:39:18,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:39:17" (1/3) ... [2025-03-17 17:39:18,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35741acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:39:18, skipping insertion in model container [2025-03-17 17:39:18,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:39:18" (2/3) ... [2025-03-17 17:39:18,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35741acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:39:18, skipping insertion in model container [2025-03-17 17:39:18,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:39:18" (3/3) ... [2025-03-17 17:39:18,755 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_08_good.i [2025-03-17 17:39:18,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 17:39:18,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_max_multiply_08_good.i that has 5 procedures, 82 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-17 17:39:18,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 17:39:18,824 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;@73915fbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 17:39:18,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 17:39:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 63 states have internal predecessors, (74), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 17:39:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 17:39:18,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:18,831 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] [2025-03-17 17:39:18,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:18,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1575297657, now seen corresponding path program 1 times [2025-03-17 17:39:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:18,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210189360] [2025-03-17 17:39:18,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:18,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 17:39:18,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 17:39:18,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:18,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:19,056 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:39:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:19,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210189360] [2025-03-17 17:39:19,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210189360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:19,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:39:19,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:39:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474116497] [2025-03-17 17:39:19,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:19,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:39:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:19,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:39:19,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:39:19,079 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 63 states have internal predecessors, (74), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 17:39:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:19,127 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2025-03-17 17:39:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:39:19,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-17 17:39:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:19,136 INFO L225 Difference]: With dead ends: 158 [2025-03-17 17:39:19,136 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 17:39:19,140 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:39:19,142 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:39:19,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 217 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 17:39:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-03-17 17:39:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.411764705882353) internal successors, (72), 62 states have internal predecessors, (72), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 17:39:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2025-03-17 17:39:19,184 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 22 [2025-03-17 17:39:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:19,185 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2025-03-17 17:39:19,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 17:39:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2025-03-17 17:39:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 17:39:19,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:19,187 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] [2025-03-17 17:39:19,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 17:39:19,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:19,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1378784152, now seen corresponding path program 1 times [2025-03-17 17:39:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:19,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198377040] [2025-03-17 17:39:19,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:19,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 17:39:19,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 17:39:19,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:19,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:19,304 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:39:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198377040] [2025-03-17 17:39:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198377040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:19,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:39:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 17:39:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561315315] [2025-03-17 17:39:19,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:19,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:39:19,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:19,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:39:19,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:39:19,307 INFO L87 Difference]: Start difference. First operand 80 states and 106 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 17:39:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:19,324 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2025-03-17 17:39:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:39:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-17 17:39:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:19,325 INFO L225 Difference]: With dead ends: 138 [2025-03-17 17:39:19,325 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 17:39:19,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:39:19,326 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 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:39:19,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 17:39:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 17:39:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 52 states have internal predecessors, (59), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 17:39:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-03-17 17:39:19,331 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 22 [2025-03-17 17:39:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:19,332 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-03-17 17:39:19,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 17:39:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-03-17 17:39:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 17:39:19,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:19,332 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:19,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 17:39:19,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:19,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash 952949526, now seen corresponding path program 1 times [2025-03-17 17:39:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:19,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478249793] [2025-03-17 17:39:19,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:19,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 17:39:19,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 17:39:19,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:19,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 17:39:19,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:19,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478249793] [2025-03-17 17:39:19,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478249793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:19,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:39:19,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 17:39:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999354876] [2025-03-17 17:39:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:19,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 17:39:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:19,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 17:39:19,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 17:39:19,420 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 17:39:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:19,439 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2025-03-17 17:39:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 17:39:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-03-17 17:39:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:19,441 INFO L225 Difference]: With dead ends: 125 [2025-03-17 17:39:19,442 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 17:39:19,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:39:19,443 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 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:39:19,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 17:39:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 17:39:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 51 states have internal predecessors, (58), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 17:39:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2025-03-17 17:39:19,456 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 40 [2025-03-17 17:39:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:19,456 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2025-03-17 17:39:19,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 17:39:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2025-03-17 17:39:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 17:39:19,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:19,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 17:39:19,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:19,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1876329261, now seen corresponding path program 1 times [2025-03-17 17:39:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:19,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498775958] [2025-03-17 17:39:19,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:19,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 17:39:19,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 17:39:19,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:19,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 17:39:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498775958] [2025-03-17 17:39:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498775958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:19,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:39:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:39:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085198357] [2025-03-17 17:39:19,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:19,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:39:19,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:19,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:39:19,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:39:19,535 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 17:39:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:19,560 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2025-03-17 17:39:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:39:19,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2025-03-17 17:39:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:19,561 INFO L225 Difference]: With dead ends: 120 [2025-03-17 17:39:19,561 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 17:39:19,562 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:39:19,562 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 159 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:39:19,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 159 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 17:39:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-03-17 17:39:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.3125) internal successors, (63), 55 states have internal predecessors, (63), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 17:39:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2025-03-17 17:39:19,573 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 42 [2025-03-17 17:39:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:19,573 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2025-03-17 17:39:19,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 17:39:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2025-03-17 17:39:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 17:39:19,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:19,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:19,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 17:39:19,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:19,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2072842766, now seen corresponding path program 1 times [2025-03-17 17:39:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:19,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176476115] [2025-03-17 17:39:19,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:19,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:19,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 17:39:19,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 17:39:19,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:19,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 17:39:19,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:19,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176476115] [2025-03-17 17:39:19,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176476115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:39:19,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644213206] [2025-03-17 17:39:19,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:19,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:19,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:39:19,640 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:39:19,642 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:39:19,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 17:39:19,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 17:39:19,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:19,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:19,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:39:19,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:39:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 17:39:19,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:39:19,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644213206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:19,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:39:19,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 17:39:19,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836951155] [2025-03-17 17:39:19,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:19,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:39:19,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:19,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:39:19,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:19,772 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 17:39:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:19,787 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2025-03-17 17:39:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:39:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2025-03-17 17:39:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:19,788 INFO L225 Difference]: With dead ends: 115 [2025-03-17 17:39:19,790 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 17:39:19,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:19,790 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:39:19,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 17:39:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-03-17 17:39:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.25) internal successors, (55), 49 states have internal predecessors, (55), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 17:39:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2025-03-17 17:39:19,799 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 42 [2025-03-17 17:39:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:19,800 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2025-03-17 17:39:19,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 17:39:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2025-03-17 17:39:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 17:39:19,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:19,801 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:19,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 17:39:20,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:20,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:20,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1526218854, now seen corresponding path program 1 times [2025-03-17 17:39:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:20,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752285427] [2025-03-17 17:39:20,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:20,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:20,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 17:39:20,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 17:39:20,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:20,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 17:39:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752285427] [2025-03-17 17:39:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752285427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:39:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116008680] [2025-03-17 17:39:20,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:20,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:39:20,068 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:39:20,068 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:39:20,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 17:39:20,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 17:39:20,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:20,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:20,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:39:20,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:39:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 17:39:20,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:39:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116008680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:39:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 17:39:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898588392] [2025-03-17 17:39:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:20,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:39:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:20,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:39:20,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:20,150 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 17:39:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:20,166 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-03-17 17:39:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:39:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2025-03-17 17:39:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:20,168 INFO L225 Difference]: With dead ends: 89 [2025-03-17 17:39:20,168 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 17:39:20,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:20,168 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 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:39:20,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 17:39:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-03-17 17:39:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.25) internal successors, (60), 52 states have internal predecessors, (60), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 17:39:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2025-03-17 17:39:20,173 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 54 [2025-03-17 17:39:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:20,174 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2025-03-17 17:39:20,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 17:39:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2025-03-17 17:39:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 17:39:20,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:20,175 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:20,183 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:39:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 17:39:20,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:20,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 68144218, now seen corresponding path program 1 times [2025-03-17 17:39:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028233941] [2025-03-17 17:39:20,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:20,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 17:39:20,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 17:39:20,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:20,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 17:39:20,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028233941] [2025-03-17 17:39:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028233941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:39:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650653465] [2025-03-17 17:39:20,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:20,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:39:20,437 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:39:20,438 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:39:20,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 17:39:20,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 17:39:20,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:20,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:20,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:39:20,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:39:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 17:39:20,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:39:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650653465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:20,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:39:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 17:39:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33276484] [2025-03-17 17:39:20,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:20,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:39:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:20,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:39:20,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:20,530 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 17:39:20,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:20,547 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2025-03-17 17:39:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:39:20,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2025-03-17 17:39:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:20,549 INFO L225 Difference]: With dead ends: 72 [2025-03-17 17:39:20,549 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 17:39:20,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:20,551 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:39:20,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 17:39:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-17 17:39:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 17:39:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2025-03-17 17:39:20,559 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 55 [2025-03-17 17:39:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:20,560 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2025-03-17 17:39:20,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 17:39:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2025-03-17 17:39:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 17:39:20,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:20,563 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:20,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 17:39:20,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:20,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:20,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash 828616385, now seen corresponding path program 1 times [2025-03-17 17:39:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940162071] [2025-03-17 17:39:20,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:20,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 17:39:20,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 17:39:20,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:20,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 17:39:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:20,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940162071] [2025-03-17 17:39:20,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940162071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:39:20,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781654116] [2025-03-17 17:39:20,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:20,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:39:20,810 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:39:20,811 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:39:20,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 17:39:20,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 17:39:20,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:20,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:20,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:39:20,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:39:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 17:39:20,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:39:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781654116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:39:20,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 17:39:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174928082] [2025-03-17 17:39:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:20,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:39:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:20,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:39:20,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:20,905 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 17:39:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:20,920 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2025-03-17 17:39:20,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:39:20,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2025-03-17 17:39:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:20,921 INFO L225 Difference]: With dead ends: 92 [2025-03-17 17:39:20,922 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 17:39:20,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:20,923 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:39:20,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 147 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 17:39:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-17 17:39:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 49 states have internal predecessors, (56), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 17:39:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2025-03-17 17:39:20,932 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 59 [2025-03-17 17:39:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:20,932 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2025-03-17 17:39:20,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 17:39:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2025-03-17 17:39:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 17:39:20,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:20,933 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:20,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 17:39:21,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:21,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:21,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -189474098, now seen corresponding path program 1 times [2025-03-17 17:39:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:21,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110158567] [2025-03-17 17:39:21,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:21,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 17:39:21,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 17:39:21,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:21,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-17 17:39:21,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:21,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110158567] [2025-03-17 17:39:21,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110158567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:39:21,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581305671] [2025-03-17 17:39:21,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:21,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:21,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:39:21,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 17:39:21,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 17:39:21,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 17:39:21,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 17:39:21,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:21,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:21,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:39:21,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:39:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 17:39:21,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:39:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581305671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:39:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 17:39:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363305668] [2025-03-17 17:39:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:21,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:39:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:21,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:39:21,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:21,297 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 17:39:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:21,311 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2025-03-17 17:39:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:39:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2025-03-17 17:39:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:21,313 INFO L225 Difference]: With dead ends: 75 [2025-03-17 17:39:21,313 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 17:39:21,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:21,313 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:39:21,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 17:39:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-03-17 17:39:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 17:39:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2025-03-17 17:39:21,324 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 67 [2025-03-17 17:39:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:21,324 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-03-17 17:39:21,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 17:39:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2025-03-17 17:39:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 17:39:21,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:21,328 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:21,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 17:39:21,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:21,528 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:21,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:21,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1996928561, now seen corresponding path program 1 times [2025-03-17 17:39:21,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:21,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530273608] [2025-03-17 17:39:21,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:21,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 17:39:21,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 17:39:21,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:21,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-17 17:39:21,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:21,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530273608] [2025-03-17 17:39:21,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530273608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:39:21,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095828484] [2025-03-17 17:39:21,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:21,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:21,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:39:21,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 17:39:21,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 17:39:21,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 17:39:21,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 17:39:21,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:21,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:21,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:39:21,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:39:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 17:39:21,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:39:21,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095828484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:21,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:39:21,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 17:39:21,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358777489] [2025-03-17 17:39:21,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:21,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:39:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:21,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:39:21,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:21,642 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 17:39:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:21,648 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2025-03-17 17:39:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:39:21,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2025-03-17 17:39:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:21,649 INFO L225 Difference]: With dead ends: 75 [2025-03-17 17:39:21,649 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 17:39:21,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:21,650 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:39:21,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 17:39:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 17:39:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.148936170212766) internal successors, (54), 48 states have internal predecessors, (54), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 17:39:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2025-03-17 17:39:21,654 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 67 [2025-03-17 17:39:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:21,655 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2025-03-17 17:39:21,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 17:39:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2025-03-17 17:39:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 17:39:21,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:39:21,656 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:21,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 17:39:21,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:21,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 17:39:21,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:39:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1578729759, now seen corresponding path program 1 times [2025-03-17 17:39:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:39:21,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360450346] [2025-03-17 17:39:21,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:21,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:39:21,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 17:39:21,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 17:39:21,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:21,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-17 17:39:21,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:39:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360450346] [2025-03-17 17:39:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360450346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:39:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324580212] [2025-03-17 17:39:21,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:39:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:39:21,904 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 17:39:21,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 17:39:21,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 17:39:21,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 17:39:21,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:39:21,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:39:21,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:39:21,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:39:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 17:39:21,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:39:21,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324580212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:39:21,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:39:21,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 17:39:21,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149506200] [2025-03-17 17:39:21,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:39:21,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:39:21,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:39:21,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:39:21,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:21,989 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 17:39:21,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:39:21,997 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2025-03-17 17:39:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:39:21,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2025-03-17 17:39:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:39:21,998 INFO L225 Difference]: With dead ends: 67 [2025-03-17 17:39:21,998 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 17:39:21,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 17:39:21,999 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:39:21,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:39:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 17:39:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 17:39:22,000 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:39:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 17:39:22,000 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2025-03-17 17:39:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:39:22,001 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 17:39:22,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 17:39:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 17:39:22,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 17:39:22,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 17:39:22,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 17:39:22,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 17:39:22,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 17:39:22,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 17:39:22,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 17:39:22,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 17:39:22,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 17:39:22,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 17:39:22,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:39:22,208 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:39:22,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 17:39:22,248 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 17:39:22,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:39:22 BoogieIcfgContainer [2025-03-17 17:39:22,252 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 17:39:22,252 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 17:39:22,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 17:39:22,253 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 17:39:22,254 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:39:18" (3/4) ... [2025-03-17 17:39:22,255 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 17:39:22,259 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 17:39:22,260 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2025-03-17 17:39:22,260 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 17:39:22,260 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2025-03-17 17:39:22,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-17 17:39:22,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 17:39:22,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 17:39:22,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 17:39:22,340 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 17:39:22,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 17:39:22,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 17:39:22,342 INFO L158 Benchmark]: Toolchain (without parser) took 4713.32ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 124.3MB in the end (delta: 5.7MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. [2025-03-17 17:39:22,342 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:39:22,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 775.31ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 70.1MB in the end (delta: 59.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 17:39:22,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.18ms. Allocated memory is still 167.8MB. Free memory was 70.1MB in the beginning and 67.2MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 17:39:22,343 INFO L158 Benchmark]: Boogie Preprocessor took 21.89ms. Allocated memory is still 167.8MB. Free memory was 67.2MB in the beginning and 65.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:39:22,343 INFO L158 Benchmark]: IcfgBuilder took 277.87ms. Allocated memory is still 167.8MB. Free memory was 65.9MB in the beginning and 49.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 17:39:22,344 INFO L158 Benchmark]: TraceAbstraction took 3502.05ms. Allocated memory is still 167.8MB. Free memory was 48.9MB in the beginning and 47.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:39:22,344 INFO L158 Benchmark]: Witness Printer took 88.42ms. Allocated memory is still 167.8MB. Free memory was 47.0MB in the beginning and 124.3MB in the end (delta: -77.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 17:39:22,345 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 775.31ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 70.1MB in the end (delta: 59.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.18ms. Allocated memory is still 167.8MB. Free memory was 70.1MB in the beginning and 67.2MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.89ms. Allocated memory is still 167.8MB. Free memory was 67.2MB in the beginning and 65.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 277.87ms. Allocated memory is still 167.8MB. Free memory was 65.9MB in the beginning and 49.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3502.05ms. Allocated memory is still 167.8MB. Free memory was 48.9MB in the beginning and 47.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 88.42ms. Allocated memory is still 167.8MB. Free memory was 47.0MB in the beginning and 124.3MB in the end (delta: -77.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: 1641]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1641]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: 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 5 procedures, 82 locations, 128 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 1872 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 975 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 897 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 35, 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, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 950 NumberOfCodeBlocks, 950 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 932 ConstructedInterpolants, 0 QuantifiedInterpolants, 1112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1240 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 504/530 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 17:39:22,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE