./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_17_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d4ea41e2590f6d53feb4a10faaed8fdc938d31e5e9690998824676ba87605bf2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 12:34:12,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 12:34:12,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 12:34:12,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 12:34:12,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 12:34:12,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 12:34:12,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 12:34:12,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 12:34:12,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 12:34:12,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 12:34:12,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 12:34:12,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 12:34:12,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 12:34:12,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 12:34:12,792 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 12:34:12,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 12:34:12,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 12:34:12,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 12:34:12,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 12:34:12,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 12:34:12,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 12:34:12,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 12:34:12,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:34:12,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 12:34:12,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 12:34:12,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 12:34:12,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 12:34:12,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 12:34:12,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 12:34:12,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 12:34:12,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 12:34:12,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 12:34:12,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 12:34:12,795 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 -> d4ea41e2590f6d53feb4a10faaed8fdc938d31e5e9690998824676ba87605bf2 [2025-03-04 12:34:13,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 12:34:13,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 12:34:13,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 12:34:13,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 12:34:13,044 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 12:34:13,045 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_fgets_add_17_good.i [2025-03-04 12:34:14,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d197988/9fe5dd7a1c3340e780094d2c7dfb9fcf/FLAGd9bfbbf10 [2025-03-04 12:34:14,555 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 12:34:14,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_17_good.i [2025-03-04 12:34:14,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d197988/9fe5dd7a1c3340e780094d2c7dfb9fcf/FLAGd9bfbbf10 [2025-03-04 12:34:14,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d197988/9fe5dd7a1c3340e780094d2c7dfb9fcf [2025-03-04 12:34:14,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 12:34:14,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 12:34:14,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 12:34:14,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 12:34:14,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 12:34:14,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:34:14" (1/1) ... [2025-03-04 12:34:14,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a962304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:14, skipping insertion in model container [2025-03-04 12:34:14,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:34:14" (1/1) ... [2025-03-04 12:34:14,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 12:34:15,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:34:15,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 12:34:15,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:34:15,462 INFO L204 MainTranslator]: Completed translation [2025-03-04 12:34:15,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15 WrapperNode [2025-03-04 12:34:15,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 12:34:15,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 12:34:15,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 12:34:15,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 12:34:15,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,496 INFO L138 Inliner]: procedures = 500, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 100 [2025-03-04 12:34:15,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 12:34:15,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 12:34:15,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 12:34:15,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 12:34:15,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,517 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-04 12:34:15,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 12:34:15,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 12:34:15,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 12:34:15,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 12:34:15,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (1/1) ... [2025-03-04 12:34:15,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:34:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:34:15,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 12:34:15,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 12:34:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 12:34:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 12:34:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 12:34:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 12:34:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 12:34:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 12:34:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 12:34:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 12:34:15,674 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 12:34:15,675 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 12:34:15,808 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-04 12:34:15,808 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 12:34:15,816 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 12:34:15,816 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 12:34:15,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:34:15 BoogieIcfgContainer [2025-03-04 12:34:15,817 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 12:34:15,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 12:34:15,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 12:34:15,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 12:34:15,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:34:14" (1/3) ... [2025-03-04 12:34:15,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b5da53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:34:15, skipping insertion in model container [2025-03-04 12:34:15,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:15" (2/3) ... [2025-03-04 12:34:15,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b5da53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:34:15, skipping insertion in model container [2025-03-04 12:34:15,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:34:15" (3/3) ... [2025-03-04 12:34:15,824 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_17_good.i [2025-03-04 12:34:15,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 12:34:15,836 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_add_17_good.i that has 3 procedures, 57 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-04 12:34:15,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 12:34:15,879 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;@46437403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 12:34:15,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 12:34:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 50 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 12:34:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 12:34:15,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:15,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:15,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:15,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash 143499017, now seen corresponding path program 1 times [2025-03-04 12:34:15,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434187274] [2025-03-04 12:34:15,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:15,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 12:34:16,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 12:34:16,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:16,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 12:34:16,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:16,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434187274] [2025-03-04 12:34:16,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434187274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:16,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:34:16,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:34:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941934037] [2025-03-04 12:34:16,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:16,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:34:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:16,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:34:16,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:34:16,201 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 50 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:16,251 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2025-03-04 12:34:16,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:34:16,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 12:34:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:16,257 INFO L225 Difference]: With dead ends: 110 [2025-03-04 12:34:16,257 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 12:34:16,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:34:16,265 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:16,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 182 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 12:34:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 12:34:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 50 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 12:34:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-04 12:34:16,295 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 12 [2025-03-04 12:34:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:16,296 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-04 12:34:16,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-04 12:34:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 12:34:16,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:16,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:16,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 12:34:16,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:16,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1434242972, now seen corresponding path program 1 times [2025-03-04 12:34:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:16,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476115109] [2025-03-04 12:34:16,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:16,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:16,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 12:34:16,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 12:34:16,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:16,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 12:34:16,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:16,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476115109] [2025-03-04 12:34:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476115109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:34:16,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428885511] [2025-03-04 12:34:16,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:16,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:34:16,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:34:16,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:34:16,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 12:34:16,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 12:34:16,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 12:34:16,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:16,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:16,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 12:34:16,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:34:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 12:34:16,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:34:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428885511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:16,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:34:16,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 12:34:16,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296783672] [2025-03-04 12:34:16,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:16,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 12:34:16,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:16,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 12:34:16,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:34:16,639 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:16,670 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2025-03-04 12:34:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 12:34:16,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 12:34:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:16,671 INFO L225 Difference]: With dead ends: 95 [2025-03-04 12:34:16,671 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 12:34:16,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:34:16,672 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:16,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 12:34:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 12:34:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.46875) internal successors, (47), 43 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 12:34:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-04 12:34:16,676 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 17 [2025-03-04 12:34:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:16,677 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-04 12:34:16,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-04 12:34:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 12:34:16,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:16,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:16,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 12:34:16,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:34:16,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:16,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1434519068, now seen corresponding path program 1 times [2025-03-04 12:34:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527873813] [2025-03-04 12:34:16,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:16,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 12:34:16,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 12:34:16,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:16,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 12:34:16,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527873813] [2025-03-04 12:34:16,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527873813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:16,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:34:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:34:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308403823] [2025-03-04 12:34:16,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:16,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:34:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:16,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:34:16,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:34:16,943 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:16,958 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-04 12:34:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:34:16,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 12:34:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:16,959 INFO L225 Difference]: With dead ends: 49 [2025-03-04 12:34:16,959 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 12:34:16,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:34:16,960 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:16,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 82 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 12:34:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 12:34:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.4375) internal successors, (46), 42 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 12:34:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-04 12:34:16,964 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 17 [2025-03-04 12:34:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:16,965 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-04 12:34:16,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-04 12:34:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 12:34:16,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:16,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:16,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 12:34:16,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:16,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1520418140, now seen corresponding path program 1 times [2025-03-04 12:34:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114501975] [2025-03-04 12:34:16,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:16,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 12:34:16,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 12:34:16,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:16,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 12:34:16,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:16,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114501975] [2025-03-04 12:34:16,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114501975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:16,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:34:16,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:34:16,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546867274] [2025-03-04 12:34:16,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:16,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:34:16,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:16,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:34:16,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:34:16,995 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:17,009 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2025-03-04 12:34:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:34:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 12:34:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:17,010 INFO L225 Difference]: With dead ends: 96 [2025-03-04 12:34:17,010 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 12:34:17,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:34:17,011 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 15 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:17,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 12:34:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2025-03-04 12:34:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 12:34:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-04 12:34:17,018 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 18 [2025-03-04 12:34:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:17,019 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-04 12:34:17,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-04 12:34:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 12:34:17,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:17,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:17,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 12:34:17,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:17,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1520401194, now seen corresponding path program 1 times [2025-03-04 12:34:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009425932] [2025-03-04 12:34:17,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:17,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 12:34:17,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 12:34:17,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:17,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 12:34:17,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:17,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009425932] [2025-03-04 12:34:17,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009425932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:17,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:34:17,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:34:17,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170314515] [2025-03-04 12:34:17,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:17,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:34:17,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:17,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:34:17,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:34:17,071 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:17,084 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2025-03-04 12:34:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:34:17,084 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 12:34:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:17,085 INFO L225 Difference]: With dead ends: 87 [2025-03-04 12:34:17,085 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 12:34:17,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:34:17,086 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:17,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 101 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 12:34:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2025-03-04 12:34:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 12:34:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-03-04 12:34:17,092 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 18 [2025-03-04 12:34:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:17,092 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-03-04 12:34:17,092 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:34:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-03-04 12:34:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 12:34:17,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:17,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:17,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 12:34:17,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:17,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1614971229, now seen corresponding path program 1 times [2025-03-04 12:34:17,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:17,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219058278] [2025-03-04 12:34:17,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:17,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:17,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 12:34:17,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 12:34:17,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:17,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 12:34:17,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219058278] [2025-03-04 12:34:17,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219058278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:17,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:34:17,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:34:17,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899265303] [2025-03-04 12:34:17,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:17,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:34:17,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:17,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:34:17,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:34:17,153 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 12:34:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:17,176 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2025-03-04 12:34:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:34:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-04 12:34:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:17,177 INFO L225 Difference]: With dead ends: 73 [2025-03-04 12:34:17,177 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 12:34:17,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:34:17,178 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:17,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 145 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 12:34:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 12:34:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 61 states have internal predecessors, (71), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 12:34:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2025-03-04 12:34:17,188 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 23 [2025-03-04 12:34:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:17,189 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-03-04 12:34:17,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 12:34:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2025-03-04 12:34:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 12:34:17,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:17,190 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:17,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 12:34:17,191 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:17,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash 955133458, now seen corresponding path program 1 times [2025-03-04 12:34:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:17,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431882870] [2025-03-04 12:34:17,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:17,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 12:34:17,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 12:34:17,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:17,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 12:34:17,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:17,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431882870] [2025-03-04 12:34:17,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431882870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:17,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:34:17,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:34:17,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777006738] [2025-03-04 12:34:17,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:17,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:34:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:17,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:34:17,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:34:17,260 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 12:34:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:17,279 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2025-03-04 12:34:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:34:17,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 12:34:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:17,280 INFO L225 Difference]: With dead ends: 90 [2025-03-04 12:34:17,281 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 12:34:17,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:34:17,282 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:17,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 151 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 12:34:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 12:34:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 64 states have internal predecessors, (74), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 12:34:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2025-03-04 12:34:17,292 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 28 [2025-03-04 12:34:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:17,292 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-03-04 12:34:17,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 12:34:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2025-03-04 12:34:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 12:34:17,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:17,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:17,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 12:34:17,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:17,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash 222506439, now seen corresponding path program 1 times [2025-03-04 12:34:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050701311] [2025-03-04 12:34:17,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:17,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 12:34:17,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 12:34:17,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:17,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 12:34:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050701311] [2025-03-04 12:34:17,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050701311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:34:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806838341] [2025-03-04 12:34:17,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:17,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:34:17,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:34:17,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:34:17,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 12:34:17,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 12:34:17,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 12:34:17,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:17,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:17,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 12:34:17,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:34:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 12:34:17,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:34:17,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806838341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:17,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:34:17,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 12:34:17,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220624209] [2025-03-04 12:34:17,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:17,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 12:34:17,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:17,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 12:34:17,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:34:17,456 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 12:34:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:17,472 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2025-03-04 12:34:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 12:34:17,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-04 12:34:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:17,473 INFO L225 Difference]: With dead ends: 89 [2025-03-04 12:34:17,473 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 12:34:17,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:34:17,474 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:17,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 12:34:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-04 12:34:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 60 states have internal predecessors, (69), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 12:34:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2025-03-04 12:34:17,483 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 31 [2025-03-04 12:34:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:17,484 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-03-04 12:34:17,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 12:34:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2025-03-04 12:34:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 12:34:17,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:17,487 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:17,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 12:34:17,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 12:34:17,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:17,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash -969327199, now seen corresponding path program 1 times [2025-03-04 12:34:17,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:17,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266091594] [2025-03-04 12:34:17,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:17,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:17,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 12:34:17,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 12:34:17,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:17,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 12:34:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266091594] [2025-03-04 12:34:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266091594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:34:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940357946] [2025-03-04 12:34:17,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:17,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:34:17,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:34:17,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:34:17,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 12:34:17,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 12:34:17,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 12:34:17,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:17,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:17,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 12:34:17,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:34:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 12:34:17,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:34:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940357946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:17,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:34:17,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 12:34:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730497678] [2025-03-04 12:34:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:17,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 12:34:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:17,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 12:34:17,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:34:17,837 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 12:34:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:17,855 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2025-03-04 12:34:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 12:34:17,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-03-04 12:34:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:17,856 INFO L225 Difference]: With dead ends: 95 [2025-03-04 12:34:17,856 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 12:34:17,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:34:17,856 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:17,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 167 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 12:34:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2025-03-04 12:34:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.175) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 12:34:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-03-04 12:34:17,869 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 33 [2025-03-04 12:34:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:17,869 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-03-04 12:34:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 12:34:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-03-04 12:34:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 12:34:17,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:17,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:17,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 12:34:18,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:34:18,070 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1692239953, now seen corresponding path program 1 times [2025-03-04 12:34:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:18,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227669254] [2025-03-04 12:34:18,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:18,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 12:34:18,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 12:34:18,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:18,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 12:34:18,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:18,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227669254] [2025-03-04 12:34:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227669254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:18,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:34:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:34:18,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785705849] [2025-03-04 12:34:18,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:18,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:34:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:18,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:34:18,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:34:18,102 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 12:34:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:18,109 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-03-04 12:34:18,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:34:18,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-04 12:34:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:18,113 INFO L225 Difference]: With dead ends: 51 [2025-03-04 12:34:18,113 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 12:34:18,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:34:18,113 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:18,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 12:34:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 12:34:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 12:34:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2025-03-04 12:34:18,119 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 32 [2025-03-04 12:34:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:18,119 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-03-04 12:34:18,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 12:34:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2025-03-04 12:34:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 12:34:18,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:18,120 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:18,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 12:34:18,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:18,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1730680003, now seen corresponding path program 1 times [2025-03-04 12:34:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45834275] [2025-03-04 12:34:18,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:18,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 12:34:18,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 12:34:18,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:18,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 12:34:18,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:18,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45834275] [2025-03-04 12:34:18,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45834275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:18,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:34:18,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:34:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339166769] [2025-03-04 12:34:18,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:18,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:34:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:18,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:34:18,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:34:18,170 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-04 12:34:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:18,186 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2025-03-04 12:34:18,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:34:18,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 39 [2025-03-04 12:34:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:18,187 INFO L225 Difference]: With dead ends: 58 [2025-03-04 12:34:18,187 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 12:34:18,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:34:18,188 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:18,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 12:34:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 12:34:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 12:34:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-03-04 12:34:18,196 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 39 [2025-03-04 12:34:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-03-04 12:34:18,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-04 12:34:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-03-04 12:34:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 12:34:18,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:34:18,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:18,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 12:34:18,197 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:34:18,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:34:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1124413591, now seen corresponding path program 1 times [2025-03-04 12:34:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:34:18,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32625400] [2025-03-04 12:34:18,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:34:18,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 12:34:18,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 12:34:18,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:18,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 12:34:18,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:34:18,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32625400] [2025-03-04 12:34:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32625400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:34:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682511938] [2025-03-04 12:34:18,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:34:18,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:34:18,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:34:18,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:34:18,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 12:34:18,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 12:34:18,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 12:34:18,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:34:18,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:34:18,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 12:34:18,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:34:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 12:34:18,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:34:18,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682511938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:34:18,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:34:18,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 12:34:18,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283106349] [2025-03-04 12:34:18,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:34:18,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 12:34:18,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:34:18,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 12:34:18,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:34:18,369 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 12:34:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:34:18,381 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-03-04 12:34:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 12:34:18,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2025-03-04 12:34:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:34:18,382 INFO L225 Difference]: With dead ends: 60 [2025-03-04 12:34:18,382 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 12:34:18,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:34:18,383 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:34:18,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:34:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 12:34:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 12:34:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 12:34:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 12:34:18,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2025-03-04 12:34:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:34:18,384 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 12:34:18,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 12:34:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 12:34:18,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 12:34:18,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 12:34:18,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 12:34:18,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 12:34:18,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 12:34:18,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 12:34:18,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 12:34:18,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 12:34:18,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 12:34:18,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 12:34:18,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 12:34:18,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 12:34:18,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 12:34:18,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 12:34:18,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:34:18,591 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:34:18,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 12:34:18,680 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 12:34:18,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:34:18 BoogieIcfgContainer [2025-03-04 12:34:18,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 12:34:18,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 12:34:18,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 12:34:18,693 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 12:34:18,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:34:15" (3/4) ... [2025-03-04 12:34:18,695 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 12:34:18,699 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 12:34:18,699 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 12:34:18,703 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 12:34:18,703 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 12:34:18,703 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 12:34:18,704 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 12:34:18,769 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 12:34:18,769 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 12:34:18,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 12:34:18,769 INFO L158 Benchmark]: Toolchain (without parser) took 4010.99ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 92.5MB in the end (delta: 16.2MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2025-03-04 12:34:18,769 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:34:18,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.47ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 49.4MB in the end (delta: 59.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 12:34:18,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.74ms. Allocated memory is still 142.6MB. Free memory was 49.4MB in the beginning and 47.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:34:18,770 INFO L158 Benchmark]: Boogie Preprocessor took 28.28ms. Allocated memory is still 142.6MB. Free memory was 47.0MB in the beginning and 45.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:34:18,770 INFO L158 Benchmark]: IcfgBuilder took 290.68ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 98.8MB in the end (delta: -53.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-03-04 12:34:18,770 INFO L158 Benchmark]: TraceAbstraction took 2873.90ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 99.6MB in the end (delta: -1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:34:18,770 INFO L158 Benchmark]: Witness Printer took 75.94ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 92.5MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:34:18,773 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.27ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.47ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 49.4MB in the end (delta: 59.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.74ms. Allocated memory is still 142.6MB. Free memory was 49.4MB in the beginning and 47.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.28ms. Allocated memory is still 142.6MB. Free memory was 47.0MB in the beginning and 45.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 290.68ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 98.8MB in the end (delta: -53.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2873.90ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 99.6MB in the end (delta: -1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 75.94ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 92.5MB in the end (delta: 7.1MB). 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: 1589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 1611 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 999 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 160 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 612 mSDtfsCounter, 160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=7, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 447 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 652 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 116/120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1553]: Location Invariant Derived location invariant: (((1 <= i) && (0 <= (data + 2147483648))) || (((0 <= (data + 2147483648)) && (i == 0)) && (data <= 2147483646))) - InvariantResult [Line: 1585]: Location Invariant Derived location invariant: (((1 <= h) && (data == 2)) || (h == 0)) - InvariantResult [Line: 1567]: Location Invariant Derived location invariant: (((k == 0) && (0 <= (data + 2147483648))) || ((1 <= k) && (0 <= (data + 2147483648)))) - InvariantResult [Line: 1589]: Location Invariant Derived location invariant: (((1 <= j) && (data == 2)) || ((j == 0) && (data == 2))) RESULT: Ultimate proved your program to be correct! [2025-03-04 12:34:18,788 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