./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/sum01_bug02.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/loops/sum01_bug02.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29d100da65e2ae9d5c43d48b49216d155078158e341858baee0b08b697e15c8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:28:25,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:28:25,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:28:25,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:28:25,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:28:25,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:28:25,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:28:25,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:28:25,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:28:25,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:28:25,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:28:25,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:28:25,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:28:25,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:28:25,323 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:28:25,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:28:25,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:28:25,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:28:25,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:28:25,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:28:25,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:28:25,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:28:25,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:28:25,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:28:25,324 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:28:25,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:28:25,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:28:25,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:28:25,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:28:25,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:28:25,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:28:25,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:28:25,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:28:25,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:28:25,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:28:25,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:28:25,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:28:25,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:28:25,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:28:25,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:28:25,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:28:25,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:28:25,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:28:25,325 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29d100da65e2ae9d5c43d48b49216d155078158e341858baee0b08b697e15c8e [2025-03-03 13:28:25,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:28:25,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:28:25,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:28:25,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:28:25,554 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:28:25,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/sum01_bug02.i [2025-03-03 13:28:26,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4726a92d0/c4532e75f87f4fbe8ff4fef9f2adbfcb/FLAG5a6a0efab [2025-03-03 13:28:26,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:28:26,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02.i [2025-03-03 13:28:26,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4726a92d0/c4532e75f87f4fbe8ff4fef9f2adbfcb/FLAG5a6a0efab [2025-03-03 13:28:27,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4726a92d0/c4532e75f87f4fbe8ff4fef9f2adbfcb [2025-03-03 13:28:27,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:28:27,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:28:27,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:28:27,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:28:27,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:28:27,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a977924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27, skipping insertion in model container [2025-03-03 13:28:27,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:28:27,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02.i[812,825] [2025-03-03 13:28:27,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:28:27,420 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:28:27,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02.i[812,825] [2025-03-03 13:28:27,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:28:27,439 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:28:27,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27 WrapperNode [2025-03-03 13:28:27,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:28:27,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:28:27,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:28:27,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:28:27,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,460 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-03-03 13:28:27,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:28:27,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:28:27,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:28:27,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:28:27,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,477 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:28:27,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:28:27,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:28:27,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:28:27,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:28:27,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (1/1) ... [2025-03-03 13:28:27,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:28:27,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:27,511 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-03 13:28:27,513 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-03 13:28:27,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:28:27,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:28:27,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:28:27,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:28:27,576 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:28:27,577 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:28:27,684 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 13:28:27,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:28:27,692 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:28:27,692 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:28:27,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:28:27 BoogieIcfgContainer [2025-03-03 13:28:27,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:28:27,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:28:27,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:28:27,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:28:27,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:28:27" (1/3) ... [2025-03-03 13:28:27,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a6361b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:28:27, skipping insertion in model container [2025-03-03 13:28:27,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:27" (2/3) ... [2025-03-03 13:28:27,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a6361b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:28:27, skipping insertion in model container [2025-03-03 13:28:27,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:28:27" (3/3) ... [2025-03-03 13:28:27,702 INFO L128 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2025-03-03 13:28:27,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:28:27,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum01_bug02.i that has 1 procedures, 13 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:28:27,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:28:27,762 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;@6037bac1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:28:27,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:28:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-03 13:28:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-03 13:28:27,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:27,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-03 13:28:27,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:27,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1419011798, now seen corresponding path program 1 times [2025-03-03 13:28:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:27,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802724746] [2025-03-03 13:28:27,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:27,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:27,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 13:28:27,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 13:28:27,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:27,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:28,000 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-03 13:28:28,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802724746] [2025-03-03 13:28:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802724746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:28:28,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:28:28,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:28:28,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662283414] [2025-03-03 13:28:28,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:28:28,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:28:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:28,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:28:28,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:28:28,021 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-03 13:28:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:28,062 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2025-03-03 13:28:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:28:28,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-03 13:28:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:28,068 INFO L225 Difference]: With dead ends: 23 [2025-03-03 13:28:28,068 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 13:28:28,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:28:28,071 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:28,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 25 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 13:28:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 13:28:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-03 13:28:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-03 13:28:28,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2025-03-03 13:28:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:28,094 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-03 13:28:28,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-03 13:28:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-03 13:28:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:28:28,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:28,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:28,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:28:28,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:28,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:28,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1464283572, now seen corresponding path program 1 times [2025-03-03 13:28:28,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:28,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942733956] [2025-03-03 13:28:28,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:28,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:28:28,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:28:28,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:28,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:28,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942733956] [2025-03-03 13:28:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942733956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860226496] [2025-03-03 13:28:28,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:28,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:28,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:28,332 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-03 13:28:28,335 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-03 13:28:28,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:28:28,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:28:28,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:28,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:28,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:28:28,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:28,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860226496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:28,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-03 13:28:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64509587] [2025-03-03 13:28:28,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:28,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:28:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:28,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:28:28,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:28:28,661 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-03 13:28:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:28,776 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-03 13:28:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:28:28,776 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 9 [2025-03-03 13:28:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:28,777 INFO L225 Difference]: With dead ends: 25 [2025-03-03 13:28:28,777 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 13:28:28,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-03 13:28:28,777 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:28,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 33 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:28:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 13:28:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2025-03-03 13:28:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-03 13:28:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-03 13:28:28,782 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2025-03-03 13:28:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:28,782 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-03 13:28:28,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-03 13:28:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-03 13:28:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 13:28:28,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:28,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:28,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:28:28,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:28,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:28,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1630192279, now seen corresponding path program 1 times [2025-03-03 13:28:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446064820] [2025-03-03 13:28:28,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:28,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:28:28,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:28:28,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:28,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:29,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:29,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446064820] [2025-03-03 13:28:29,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446064820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:29,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040518842] [2025-03-03 13:28:29,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:29,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:29,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:29,055 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-03 13:28:29,057 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-03 13:28:29,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:28:29,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:28:29,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:29,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:29,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:28:29,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:29,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:29,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040518842] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:29,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:29,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-03 13:28:29,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166507395] [2025-03-03 13:28:29,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:29,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:28:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:29,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:28:29,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:28:29,156 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-03 13:28:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:29,191 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-03-03 13:28:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:28:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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 12 [2025-03-03 13:28:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:29,191 INFO L225 Difference]: With dead ends: 30 [2025-03-03 13:28:29,191 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 13:28:29,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:28:29,192 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:29,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 13:28:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-03 13:28:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-03 13:28:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-03 13:28:29,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2025-03-03 13:28:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:29,195 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-03 13:28:29,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-03 13:28:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-03 13:28:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:28:29,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:29,196 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:29,201 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-03 13:28:29,397 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,SelfDestructingSolverStorable2 [2025-03-03 13:28:29,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:29,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash 238494220, now seen corresponding path program 2 times [2025-03-03 13:28:29,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:29,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337485644] [2025-03-03 13:28:29,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:28:29,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:29,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-03 13:28:29,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:28:29,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:28:29,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337485644] [2025-03-03 13:28:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337485644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503257591] [2025-03-03 13:28:29,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:28:29,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:29,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:29,666 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-03 13:28:29,668 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-03 13:28:29,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-03 13:28:29,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:28:29,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:28:29,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:29,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:28:29,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:29,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503257591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:30,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:30,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2025-03-03 13:28:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97584473] [2025-03-03 13:28:30,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:30,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 13:28:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:30,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 13:28:30,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2025-03-03 13:28:30,020 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-03 13:28:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:30,301 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-03-03 13:28:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 13:28:30,302 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-03 13:28:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:30,302 INFO L225 Difference]: With dead ends: 28 [2025-03-03 13:28:30,302 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 13:28:30,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=1233, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 13:28:30,303 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:30,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 42 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:28:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 13:28:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-03 13:28:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-03 13:28:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-03 13:28:30,309 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2025-03-03 13:28:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:30,309 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-03 13:28:30,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-03 13:28:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-03 13:28:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:28:30,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:30,309 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:30,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:28:30,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:30,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:30,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:30,510 INFO L85 PathProgramCache]: Analyzing trace with hash 791002445, now seen corresponding path program 2 times [2025-03-03 13:28:30,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:30,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839900487] [2025-03-03 13:28:30,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:28:30,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:30,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:28:30,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:28:30,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:28:30,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:30,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839900487] [2025-03-03 13:28:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839900487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292597531] [2025-03-03 13:28:30,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:28:30,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:30,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:30,613 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-03 13:28:30,615 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-03 13:28:30,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:28:30,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:28:30,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:28:30,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:30,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:28:30,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:30,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:30,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292597531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:30,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:30,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-03 13:28:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410289322] [2025-03-03 13:28:30,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:30,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:28:30,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:30,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:28:30,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:28:30,791 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-03 13:28:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:30,825 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-03 13:28:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:28:30,825 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 21 [2025-03-03 13:28:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:30,825 INFO L225 Difference]: With dead ends: 34 [2025-03-03 13:28:30,825 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 13:28:30,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:28:30,826 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:30,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 13:28:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-03 13:28:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-03 13:28:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-03 13:28:30,830 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2025-03-03 13:28:30,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:30,830 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-03 13:28:30,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-03 13:28:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-03 13:28:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:28:30,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:30,830 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:30,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:28:31,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:31,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:31,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 939703063, now seen corresponding path program 3 times [2025-03-03 13:28:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177341901] [2025-03-03 13:28:31,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:28:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:31,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 7 equivalence classes. [2025-03-03 13:28:31,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:28:31,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 13:28:31,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:28:31,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:28:31,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:28:31,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:28:31,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:31,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:28:31,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 13:28:31,070 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:28:31,071 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:28:31,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 13:28:31,075 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1] [2025-03-03 13:28:31,090 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:28:31,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:28:31 BoogieIcfgContainer [2025-03-03 13:28:31,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:28:31,093 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:28:31,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:28:31,093 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:28:31,093 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:28:27" (3/4) ... [2025-03-03 13:28:31,094 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 13:28:31,128 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 17. [2025-03-03 13:28:31,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:28:31,174 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:28:31,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:28:31,174 INFO L158 Benchmark]: Toolchain (without parser) took 3892.98ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 44.3MB in the end (delta: 68.2MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2025-03-03 13:28:31,175 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:28:31,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.46ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:28:31,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.48ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.3MB in the end (delta: 876.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:28:31,175 INFO L158 Benchmark]: Boogie Preprocessor took 23.04ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.4MB in the end (delta: 915.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:28:31,176 INFO L158 Benchmark]: IcfgBuilder took 208.27ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 88.0MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:28:31,176 INFO L158 Benchmark]: TraceAbstraction took 3396.02ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 50.6MB in the end (delta: 37.0MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2025-03-03 13:28:31,176 INFO L158 Benchmark]: Witness Printer took 81.03ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 44.3MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:28:31,177 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.46ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.46ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.48ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.3MB in the end (delta: 876.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.04ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.4MB in the end (delta: 915.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 208.27ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 88.0MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3396.02ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 50.6MB in the end (delta: 37.0MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 81.03ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 44.3MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; VAL [j=10, n=6, sn=0] [L24] COND FALSE !(n==2147483647) [L27] i=1 VAL [i=1, j=10, n=6, sn=0] [L27] COND TRUE i<=n VAL [i=1, j=10, n=6, sn=0] [L28] COND TRUE i