./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.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/termination-memory-alloca/ex3a-alloca.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 a5b1197714500d659d0acf4ebb2204b824a1c828702d044651e5c066ddbe97af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:41:29,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:41:29,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:41:29,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:41:29,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:41:29,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:41:29,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:41:29,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:41:29,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:41:29,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:41:29,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:41:29,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:41:29,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:41:29,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:41:29,594 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:41:29,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:41:29,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:41:29,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:41:29,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:41:29,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:41:29,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:41:29,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:41:29,595 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:41:29,595 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:41:29,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:41:29,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:41:29,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:41:29,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:41:29,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:41:29,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:41:29,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:41:29,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:41:29,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:41:29,597 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 -> a5b1197714500d659d0acf4ebb2204b824a1c828702d044651e5c066ddbe97af [2025-03-04 10:41:29,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:41:29,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:41:29,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:41:29,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:41:29,842 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:41:29,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i [2025-03-04 10:41:30,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76e064e4/fe57bcf88a5647d98c96f6160b5a2c9f/FLAG02692789b [2025-03-04 10:41:31,280 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:41:31,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i [2025-03-04 10:41:31,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76e064e4/fe57bcf88a5647d98c96f6160b5a2c9f/FLAG02692789b [2025-03-04 10:41:31,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76e064e4/fe57bcf88a5647d98c96f6160b5a2c9f [2025-03-04 10:41:31,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:41:31,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:41:31,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:41:31,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:41:31,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:41:31,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59067ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31, skipping insertion in model container [2025-03-04 10:41:31,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:41:31,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:41:31,549 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:41:31,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:41:31,603 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:41:31,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31 WrapperNode [2025-03-04 10:41:31,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:41:31,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:41:31,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:41:31,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:41:31,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,632 INFO L138 Inliner]: procedures = 111, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-04 10:41:31,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:41:31,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:41:31,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:41:31,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:41:31,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,650 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [6, 4]. 60 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-03-04 10:41:31,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:41:31,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:41:31,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:41:31,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:41:31,661 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (1/1) ... [2025-03-04 10:41:31,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:41:31,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:31,694 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 10:41:31,697 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 10:41:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:41:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:41:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:41:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:41:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:41:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:41:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:41:31,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:41:31,796 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:41:31,797 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:41:31,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: havoc main_#t~nondet11#1;havoc main_#t~ret12#1; [2025-03-04 10:41:31,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc test_fun_#t~mem10#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset; [2025-03-04 10:41:31,920 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-04 10:41:31,922 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:41:31,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:41:31,930 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:41:31,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:41:31 BoogieIcfgContainer [2025-03-04 10:41:31,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:41:31,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:41:31,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:41:31,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:41:31,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:41:31" (1/3) ... [2025-03-04 10:41:31,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5ba65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:41:31, skipping insertion in model container [2025-03-04 10:41:31,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:31" (2/3) ... [2025-03-04 10:41:31,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5ba65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:41:31, skipping insertion in model container [2025-03-04 10:41:31,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:41:31" (3/3) ... [2025-03-04 10:41:31,939 INFO L128 eAbstractionObserver]: Analyzing ICFG ex3a-alloca.i [2025-03-04 10:41:31,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:41:31,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ex3a-alloca.i that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-04 10:41:31,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:41:32,002 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;@4d4c7f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:41:32,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:41:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 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 10:41:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:41:32,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:32,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:41:32,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:41:32,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1596488730, now seen corresponding path program 1 times [2025-03-04 10:41:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:32,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417879017] [2025-03-04 10:41:32,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:32,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:41:32,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:41:32,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:32,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:41:32,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320452338] [2025-03-04 10:41:32,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:32,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:32,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:32,123 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 10:41:32,125 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 10:41:32,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:41:32,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:41:32,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:32,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:32,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:41:32,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:32,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 10:41:32,330 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 10:41:32,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:41:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417879017] [2025-03-04 10:41:32,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:41:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320452338] [2025-03-04 10:41:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320452338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:32,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:41:32,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:41:32,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470801135] [2025-03-04 10:41:32,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:41:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:32,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:41:32,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:41:32,350 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 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) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 10:41:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:32,395 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-04 10:41:32,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:41:32,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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) Word has length 6 [2025-03-04 10:41:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:32,402 INFO L225 Difference]: With dead ends: 28 [2025-03-04 10:41:32,402 INFO L226 Difference]: Without dead ends: 15 [2025-03-04 10:41:32,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:41:32,406 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:32,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 32 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-04 10:41:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2025-03-04 10:41:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 11 states have internal predecessors, (13), 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 10:41:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-03-04 10:41:32,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 6 [2025-03-04 10:41:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:32,430 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-03-04 10:41:32,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 10:41:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-03-04 10:41:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:41:32,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:32,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:32,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:41:32,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 10:41:32,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:41:32,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2048456941, now seen corresponding path program 1 times [2025-03-04 10:41:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593256827] [2025-03-04 10:41:32,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:32,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:41:32,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:41:32,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:32,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:41:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531424151] [2025-03-04 10:41:32,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:32,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:32,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:32,656 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 10:41:32,657 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 10:41:32,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:41:32,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:41:32,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:32,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:32,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:41:32,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:32,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 10:41:32,803 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 10:41:32,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:41:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593256827] [2025-03-04 10:41:32,804 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:41:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531424151] [2025-03-04 10:41:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531424151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:41:32,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:41:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508081788] [2025-03-04 10:41:32,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:32,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:41:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:32,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:41:32,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:41:32,807 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 10:41:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:32,841 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-03-04 10:41:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:41:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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) Word has length 7 [2025-03-04 10:41:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:32,843 INFO L225 Difference]: With dead ends: 16 [2025-03-04 10:41:32,843 INFO L226 Difference]: Without dead ends: 15 [2025-03-04 10:41:32,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:41:32,844 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:32,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-04 10:41:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 10:41:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 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 10:41:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-04 10:41:32,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 7 [2025-03-04 10:41:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:32,846 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-04 10:41:32,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 10:41:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-04 10:41:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:41:32,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:32,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:32,856 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 10:41:33,049 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,SelfDestructingSolverStorable1 [2025-03-04 10:41:33,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:41:33,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2048427150, now seen corresponding path program 1 times [2025-03-04 10:41:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061785493] [2025-03-04 10:41:33,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:33,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:41:33,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:41:33,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:33,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:33,092 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 10:41:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:33,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061785493] [2025-03-04 10:41:33,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061785493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:33,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:41:33,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:41:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153239497] [2025-03-04 10:41:33,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:33,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:41:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:33,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:41:33,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:41:33,094 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 10:41:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:33,100 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-03-04 10:41:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:41:33,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-03-04 10:41:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:33,101 INFO L225 Difference]: With dead ends: 25 [2025-03-04 10:41:33,101 INFO L226 Difference]: Without dead ends: 11 [2025-03-04 10:41:33,101 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 10:41:33,102 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:33,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-04 10:41:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-04 10:41:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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 10:41:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-04 10:41:33,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-04 10:41:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:33,104 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-04 10:41:33,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 10:41:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-04 10:41:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:41:33,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:33,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:33,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:41:33,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:41:33,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash 922344248, now seen corresponding path program 1 times [2025-03-04 10:41:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:33,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780232540] [2025-03-04 10:41:33,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:33,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:33,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:41:33,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:41:33,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:33,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:33,219 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 10:41:33,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:33,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780232540] [2025-03-04 10:41:33,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780232540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:33,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:41:33,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:41:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376413875] [2025-03-04 10:41:33,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:33,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:41:33,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:33,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:41:33,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:41:33,221 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10:41:33,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:33,237 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-03-04 10:41:33,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:41:33,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2025-03-04 10:41:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:33,238 INFO L225 Difference]: With dead ends: 20 [2025-03-04 10:41:33,238 INFO L226 Difference]: Without dead ends: 18 [2025-03-04 10:41:33,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:41:33,238 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:33,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-04 10:41:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-04 10:41:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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 10:41:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-04 10:41:33,240 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-03-04 10:41:33,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:33,240 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-04 10:41:33,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10:41:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-04 10:41:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:41:33,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:33,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:41:33,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:41:33,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:41:33,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 954199080, now seen corresponding path program 1 times [2025-03-04 10:41:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:33,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509414592] [2025-03-04 10:41:33,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:33,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:41:33,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:41:33,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:33,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:33,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:33,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509414592] [2025-03-04 10:41:33,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509414592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:33,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964782529] [2025-03-04 10:41:33,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:33,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:33,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:33,459 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 10:41:33,462 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 10:41:33,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:41:33,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:41:33,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:33,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:33,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:41:33,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:33,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:41:33,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 10:41:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:33,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:41:33,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964782529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:33,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:41:33,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 10:41:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673340000] [2025-03-04 10:41:33,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:33,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:41:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:33,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:41:33,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:41:33,585 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 10:41:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:33,602 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-04 10:41:33,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:41:33,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2025-03-04 10:41:33,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:33,602 INFO L225 Difference]: With dead ends: 18 [2025-03-04 10:41:33,602 INFO L226 Difference]: Without dead ends: 17 [2025-03-04 10:41:33,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:41:33,603 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:33,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-04 10:41:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 10:41:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 10:41:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-03-04 10:41:33,605 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2025-03-04 10:41:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:33,605 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-03-04 10:41:33,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 10:41:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-03-04 10:41:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:41:33,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:33,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:41:33,611 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 10:41:33,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:33,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:41:33,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash -484599615, now seen corresponding path program 1 times [2025-03-04 10:41:33,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:33,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487369201] [2025-03-04 10:41:33,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:33,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:33,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:41:33,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:41:33,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:33,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:33,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487369201] [2025-03-04 10:41:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487369201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:33,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184975734] [2025-03-04 10:41:33,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:33,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:33,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:33,939 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 10:41:33,941 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 10:41:33,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:41:33,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:41:33,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:33,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:33,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:41:33,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:33,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:41:34,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 10:41:34,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:34,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:41:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184975734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:41:34,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:41:34,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:41:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177318216] [2025-03-04 10:41:34,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:41:34,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:41:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:34,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:41:34,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:41:34,096 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 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 10:41:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:34,163 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-03-04 10:41:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:41:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 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) Word has length 16 [2025-03-04 10:41:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:34,163 INFO L225 Difference]: With dead ends: 39 [2025-03-04 10:41:34,163 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:41:34,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:41:34,164 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:34,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 42 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:41:34,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 10:41:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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 10:41:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2025-03-04 10:41:34,169 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 16 [2025-03-04 10:41:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:34,169 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2025-03-04 10:41:34,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 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 10:41:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2025-03-04 10:41:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 10:41:34,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:34,170 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1] [2025-03-04 10:41:34,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:41:34,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:34,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:41:34,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1267558321, now seen corresponding path program 2 times [2025-03-04 10:41:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:34,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788668482] [2025-03-04 10:41:34,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:41:34,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:34,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:41:34,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:41:34,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:41:34,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788668482] [2025-03-04 10:41:34,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788668482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836868191] [2025-03-04 10:41:34,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:41:34,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:34,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:34,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:41:34,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:41:34,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:41:34,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:41:34,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:41:34,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:34,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:41:34,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:34,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:41:34,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 10:41:34,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 10:41:35,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 10:41:35,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 10:41:35,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:35,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:41:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:35,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836868191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:41:35,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:41:35,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-03-04 10:41:35,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764466071] [2025-03-04 10:41:35,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:41:35,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 10:41:35,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:35,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 10:41:35,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:41:35,225 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 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 10:41:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:35,374 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-03-04 10:41:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:41:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 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) Word has length 37 [2025-03-04 10:41:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:35,375 INFO L225 Difference]: With dead ends: 81 [2025-03-04 10:41:35,375 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 10:41:35,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=772, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:41:35,376 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:35,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 67 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:41:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 10:41:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 10:41:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 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 10:41:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2025-03-04 10:41:35,385 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 37 [2025-03-04 10:41:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:35,385 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2025-03-04 10:41:35,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 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 10:41:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2025-03-04 10:41:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 10:41:35,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:35,388 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 1, 1, 1] [2025-03-04 10:41:35,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:41:35,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:35,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:41:35,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:35,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1976602191, now seen corresponding path program 3 times [2025-03-04 10:41:35,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:35,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376954048] [2025-03-04 10:41:35,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:41:35,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:35,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 11 equivalence classes. [2025-03-04 10:41:35,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 10:41:35,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:41:35,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:36,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:36,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376954048] [2025-03-04 10:41:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376954048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:36,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660164309] [2025-03-04 10:41:36,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:41:36,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:36,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:36,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:41:36,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:41:36,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 11 equivalence classes. [2025-03-04 10:41:37,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 37 of 79 statements. [2025-03-04 10:41:37,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:41:37,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:37,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 10:41:37,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:37,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:41:37,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 10:41:37,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 10:41:42,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-04 10:42:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 212 proven. 2 refuted. 17 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 10:42:06,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:42:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 209 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 10:42:07,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660164309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:42:07,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:42:07,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 12] total 44 [2025-03-04 10:42:07,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182334214] [2025-03-04 10:42:07,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:42:07,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 10:42:07,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:42:07,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 10:42:07,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1623, Unknown=9, NotChecked=0, Total=1892 [2025-03-04 10:42:07,237 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand has 44 states, 44 states have (on average 3.1136363636363638) internal successors, (137), 44 states have internal predecessors, (137), 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 10:42:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:42:08,064 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2025-03-04 10:42:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:42:08,065 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1136363636363638) internal successors, (137), 44 states have internal predecessors, (137), 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) Word has length 79 [2025-03-04 10:42:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:42:08,065 INFO L225 Difference]: With dead ends: 80 [2025-03-04 10:42:08,065 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:42:08,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=586, Invalid=2827, Unknown=9, NotChecked=0, Total=3422 [2025-03-04 10:42:08,067 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:42:08,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:42:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:42:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:42:08,068 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 10:42:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:42:08,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2025-03-04 10:42:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:42:08,068 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:42:08,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1136363636363638) internal successors, (137), 44 states have internal predecessors, (137), 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 10:42:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:42:08,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:42:08,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-04 10:42:08,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-04 10:42:08,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-04 10:42:08,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-04 10:42:08,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:42:08,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:42:08,278 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-03-04 10:42:08,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:42:14,429 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-04 10:42:14,433 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:42:14,439 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:42:14,440 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:42:14,440 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] [2025-03-04 10:42:14,441 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:42:14,441 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:42:14,441 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:42:14,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] [2025-03-04 10:42:14,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:42:14 BoogieIcfgContainer [2025-03-04 10:42:14,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:42:14,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:42:14,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:42:14,443 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:42:14,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:41:31" (3/4) ... [2025-03-04 10:42:14,445 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:42:14,452 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 10:42:14,452 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:42:14,452 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 10:42:14,452 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:42:14,501 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:42:14,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:42:14,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:42:14,502 INFO L158 Benchmark]: Toolchain (without parser) took 43183.39ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 106.3MB in the beginning and 165.4MB in the end (delta: -59.1MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. [2025-03-04 10:42:14,503 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:42:14,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.24ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 89.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:42:14,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.82ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 88.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:42:14,503 INFO L158 Benchmark]: Boogie Preprocessor took 24.89ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 87.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:42:14,503 INFO L158 Benchmark]: IcfgBuilder took 270.79ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 74.8MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:42:14,504 INFO L158 Benchmark]: TraceAbstraction took 42510.42ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 73.7MB in the beginning and 170.4MB in the end (delta: -96.7MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2025-03-04 10:42:14,504 INFO L158 Benchmark]: Witness Printer took 58.66ms. Allocated memory is still 327.2MB. Free memory was 170.4MB in the beginning and 165.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:42:14,505 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 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.24ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 89.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.82ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 88.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.89ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 87.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 270.79ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 74.8MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 42510.42ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 73.7MB in the beginning and 170.4MB in the end (delta: -96.7MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. * Witness Printer took 58.66ms. Allocated memory is still 327.2MB. Free memory was 170.4MB in the beginning and 165.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~c~0!base,]]] * 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: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: 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 1 procedures, 18 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 36.3s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 64 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 30.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=7, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 32.3s InterpolantComputationTime, 335 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 439 ConstructedInterpolants, 19 QuantifiedInterpolants, 2728 SizeOfPredicates, 15 NumberOfNonLiveVariables, 668 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 749/1398 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 10:42:14,520 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