./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/eca-rers2012/Problem10_label01.c -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 25a329399ac3f0c42bfd0b3752cc2a04cb2662736babf7dc26be2e3a4966221c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:39:26,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:39:26,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:39:26,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:39:26,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:39:26,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:39:26,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:39:26,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:39:26,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:39:26,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:39:26,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:39:26,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:39:26,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:39:26,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:39:26,601 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:39:26,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:39:26,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:39:26,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:39:26,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:39:26,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:39:26,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:39:26,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:39:26,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:39:26,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:39:26,604 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:39:26,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:39:26,604 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:39:26,604 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:39:26,604 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:39:26,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:39:26,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:39:26,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:39:26,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:39:26,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:39:26,605 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 -> 25a329399ac3f0c42bfd0b3752cc2a04cb2662736babf7dc26be2e3a4966221c [2025-03-08 01:39:26,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:39:26,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:39:26,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:39:26,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:39:26,820 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:39:26,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label01.c [2025-03-08 01:39:27,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673742216/f7c59bd20dde406d9c587a40b0a9bc9f/FLAG7bb06d598 [2025-03-08 01:39:28,268 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:39:28,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label01.c [2025-03-08 01:39:28,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673742216/f7c59bd20dde406d9c587a40b0a9bc9f/FLAG7bb06d598 [2025-03-08 01:39:28,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673742216/f7c59bd20dde406d9c587a40b0a9bc9f [2025-03-08 01:39:28,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:39:28,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:39:28,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:39:28,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:39:28,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:39:28,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:28,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf30a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28, skipping insertion in model container [2025-03-08 01:39:28,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:28,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:39:28,699 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/eca-rers2012/Problem10_label01.c[6098,6111] [2025-03-08 01:39:28,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:39:28,791 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:39:28,813 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/eca-rers2012/Problem10_label01.c[6098,6111] [2025-03-08 01:39:28,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:39:28,868 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:39:28,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28 WrapperNode [2025-03-08 01:39:28,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:39:28,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:39:28,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:39:28,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:39:28,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:28,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:28,935 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-08 01:39:28,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:39:28,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:39:28,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:39:28,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:39:28,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:28,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:28,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:28,979 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-08 01:39:28,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:28,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:28,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:29,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:29,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:29,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:29,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:39:29,023 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:39:29,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:39:29,024 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:39:29,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (1/1) ... [2025-03-08 01:39:29,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:39:29,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:39:29,053 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-08 01:39:29,055 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-08 01:39:29,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:39:29,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:39:29,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:39:29,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:39:29,124 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:39:29,126 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:39:29,960 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 01:39:29,960 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:39:29,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:39:29,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:39:29,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:29 BoogieIcfgContainer [2025-03-08 01:39:29,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:39:29,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:39:29,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:39:29,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:39:29,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:39:28" (1/3) ... [2025-03-08 01:39:29,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f7fa34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:39:29, skipping insertion in model container [2025-03-08 01:39:29,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:28" (2/3) ... [2025-03-08 01:39:29,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f7fa34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:39:29, skipping insertion in model container [2025-03-08 01:39:29,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:29" (3/3) ... [2025-03-08 01:39:29,984 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label01.c [2025-03-08 01:39:29,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:39:29,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label01.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:39:30,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:39:30,059 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;@670456d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:39:30,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:39:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 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-08 01:39:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 01:39:30,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:39:30,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:30,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:39:30,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:39:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash 29751864, now seen corresponding path program 1 times [2025-03-08 01:39:30,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:39:30,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774386961] [2025-03-08 01:39:30,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:30,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:39:30,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 01:39:30,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 01:39:30,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:30,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:30,498 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-08 01:39:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:39:30,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774386961] [2025-03-08 01:39:30,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774386961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:39:30,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:39:30,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:39:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952417427] [2025-03-08 01:39:30,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:39:30,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:39:30,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:39:30,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:39:30,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:39:30,521 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 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 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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-08 01:39:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:39:31,459 INFO L93 Difference]: Finished difference Result 696 states and 1244 transitions. [2025-03-08 01:39:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:39:31,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2025-03-08 01:39:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:39:31,467 INFO L225 Difference]: With dead ends: 696 [2025-03-08 01:39:31,467 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 01:39:31,469 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-08 01:39:31,472 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 465 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:39:31,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 44 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:39:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 01:39:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-03-08 01:39:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3833333333333333) internal successors, (581), 420 states have internal predecessors, (581), 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-08 01:39:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 581 transitions. [2025-03-08 01:39:31,518 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 581 transitions. Word has length 53 [2025-03-08 01:39:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:39:31,518 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 581 transitions. [2025-03-08 01:39:31,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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-08 01:39:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 581 transitions. [2025-03-08 01:39:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 01:39:31,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:39:31,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:31,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:39:31,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:39:31,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:39:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1022633393, now seen corresponding path program 1 times [2025-03-08 01:39:31,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:39:31,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743597776] [2025-03-08 01:39:31,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:31,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:39:31,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 01:39:31,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 01:39:31,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:31,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 01:39:31,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:39:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743597776] [2025-03-08 01:39:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743597776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:39:31,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:39:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:39:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151282336] [2025-03-08 01:39:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:39:31,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:39:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:39:31,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:39:31,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:39:31,830 INFO L87 Difference]: Start difference. First operand 421 states and 581 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-08 01:39:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:39:32,196 INFO L93 Difference]: Finished difference Result 979 states and 1440 transitions. [2025-03-08 01:39:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:39:32,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 234 [2025-03-08 01:39:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:39:32,201 INFO L225 Difference]: With dead ends: 979 [2025-03-08 01:39:32,201 INFO L226 Difference]: Without dead ends: 699 [2025-03-08 01:39:32,202 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-08 01:39:32,202 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 89 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:39:32,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 226 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:39:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-08 01:39:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 560. [2025-03-08 01:39:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3148479427549196) internal successors, (735), 559 states have internal predecessors, (735), 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-08 01:39:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2025-03-08 01:39:32,217 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 234 [2025-03-08 01:39:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:39:32,218 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2025-03-08 01:39:32,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-08 01:39:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2025-03-08 01:39:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-08 01:39:32,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:39:32,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:32,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:39:32,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:39:32,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:39:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash 454337632, now seen corresponding path program 1 times [2025-03-08 01:39:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:39:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616580155] [2025-03-08 01:39:32,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:39:32,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-08 01:39:32,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-08 01:39:32,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:32,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:39:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:39:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616580155] [2025-03-08 01:39:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616580155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:39:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:39:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:39:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709864768] [2025-03-08 01:39:32,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:39:32,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:39:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:39:32,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:39:32,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:39:32,538 INFO L87 Difference]: Start difference. First operand 560 states and 735 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-08 01:39:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:39:32,936 INFO L93 Difference]: Finished difference Result 1118 states and 1533 transitions. [2025-03-08 01:39:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:39:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 240 [2025-03-08 01:39:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:39:32,939 INFO L225 Difference]: With dead ends: 1118 [2025-03-08 01:39:32,939 INFO L226 Difference]: Without dead ends: 699 [2025-03-08 01:39:32,940 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-08 01:39:32,943 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:39:32,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 215 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:39:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-08 01:39:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-08 01:39:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2664756446991403) internal successors, (884), 698 states have internal predecessors, (884), 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-08 01:39:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 884 transitions. [2025-03-08 01:39:32,964 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 884 transitions. Word has length 240 [2025-03-08 01:39:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:39:32,965 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 884 transitions. [2025-03-08 01:39:32,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-08 01:39:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 884 transitions. [2025-03-08 01:39:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 01:39:32,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:39:32,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:32,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:39:32,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:39:32,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:39:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1233174709, now seen corresponding path program 1 times [2025-03-08 01:39:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:39:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093968165] [2025-03-08 01:39:32,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:39:33,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 01:39:33,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 01:39:33,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:39:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:39:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093968165] [2025-03-08 01:39:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093968165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:39:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:39:33,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 01:39:33,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018576983] [2025-03-08 01:39:33,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:39:33,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 01:39:33,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:39:33,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 01:39:33,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:39:33,384 INFO L87 Difference]: Start difference. First operand 699 states and 884 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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-08 01:39:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:39:33,884 INFO L93 Difference]: Finished difference Result 1312 states and 1672 transitions. [2025-03-08 01:39:33,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 01:39:33,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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 249 [2025-03-08 01:39:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:39:33,887 INFO L225 Difference]: With dead ends: 1312 [2025-03-08 01:39:33,887 INFO L226 Difference]: Without dead ends: 699 [2025-03-08 01:39:33,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:39:33,889 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:39:33,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 30 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:39:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-08 01:39:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-08 01:39:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2621776504297995) internal successors, (881), 698 states have internal predecessors, (881), 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-08 01:39:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 881 transitions. [2025-03-08 01:39:33,902 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 881 transitions. Word has length 249 [2025-03-08 01:39:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:39:33,902 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 881 transitions. [2025-03-08 01:39:33,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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-08 01:39:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 881 transitions. [2025-03-08 01:39:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-08 01:39:33,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:39:33,904 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:33,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:39:33,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:39:33,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:39:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1366027053, now seen corresponding path program 1 times [2025-03-08 01:39:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:39:33,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648228609] [2025-03-08 01:39:33,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:33,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:39:33,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 01:39:33,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 01:39:33,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:33,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 01:39:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:39:34,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648228609] [2025-03-08 01:39:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648228609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:39:34,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:39:34,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:39:34,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859612190] [2025-03-08 01:39:34,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:39:34,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:39:34,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:39:34,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:39:34,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:39:34,241 INFO L87 Difference]: Start difference. First operand 699 states and 881 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 3 states have internal predecessors, (211), 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-08 01:39:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:39:34,645 INFO L93 Difference]: Finished difference Result 1257 states and 1612 transitions. [2025-03-08 01:39:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:39:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 3 states have internal predecessors, (211), 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 261 [2025-03-08 01:39:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:39:34,647 INFO L225 Difference]: With dead ends: 1257 [2025-03-08 01:39:34,647 INFO L226 Difference]: Without dead ends: 699 [2025-03-08 01:39:34,648 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-08 01:39:34,648 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 127 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:39:34,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 87 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:39:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-08 01:39:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-08 01:39:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2550143266475644) internal successors, (876), 698 states have internal predecessors, (876), 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-08 01:39:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 876 transitions. [2025-03-08 01:39:34,663 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 876 transitions. Word has length 261 [2025-03-08 01:39:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:39:34,663 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 876 transitions. [2025-03-08 01:39:34,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 3 states have internal predecessors, (211), 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-08 01:39:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 876 transitions. [2025-03-08 01:39:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-08 01:39:34,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:39:34,666 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:34,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:39:34,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:39:34,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:39:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1459245809, now seen corresponding path program 1 times [2025-03-08 01:39:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:39:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479667047] [2025-03-08 01:39:34,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:34,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:39:34,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-08 01:39:34,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-08 01:39:34,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:34,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 116 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:39:35,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:39:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479667047] [2025-03-08 01:39:35,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479667047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:39:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959830264] [2025-03-08 01:39:35,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:35,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:39:35,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:39:35,126 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-08 01:39:35,128 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-08 01:39:35,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-08 01:39:35,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-08 01:39:35,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:35,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:35,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:39:35,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:39:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 01:39:35,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:39:35,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959830264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:39:35,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:39:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 01:39:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733684886] [2025-03-08 01:39:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:39:35,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:39:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:39:35,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:39:35,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:39:35,520 INFO L87 Difference]: Start difference. First operand 699 states and 876 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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-08 01:39:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:39:35,914 INFO L93 Difference]: Finished difference Result 1396 states and 1820 transitions. [2025-03-08 01:39:35,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:39:35,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 285 [2025-03-08 01:39:35,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:39:35,918 INFO L225 Difference]: With dead ends: 1396 [2025-03-08 01:39:35,918 INFO L226 Difference]: Without dead ends: 838 [2025-03-08 01:39:35,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:39:35,920 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:39:35,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 34 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:39:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-08 01:39:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-03-08 01:39:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2413381123058542) internal successors, (1039), 837 states have internal predecessors, (1039), 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-08 01:39:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1039 transitions. [2025-03-08 01:39:35,934 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1039 transitions. Word has length 285 [2025-03-08 01:39:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:39:35,935 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1039 transitions. [2025-03-08 01:39:35,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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-08 01:39:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1039 transitions. [2025-03-08 01:39:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-08 01:39:35,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:39:35,941 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:35,947 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-08 01:39:36,146 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,SelfDestructingSolverStorable5 [2025-03-08 01:39:36,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:39:36,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:39:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2030454617, now seen corresponding path program 1 times [2025-03-08 01:39:36,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:39:36,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041888095] [2025-03-08 01:39:36,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:39:36,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-08 01:39:36,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-08 01:39:36,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:36,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 352 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:39:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:39:36,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041888095] [2025-03-08 01:39:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041888095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:39:36,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300631371] [2025-03-08 01:39:36,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:36,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:39:36,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:39:36,499 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-08 01:39:36,501 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-08 01:39:36,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-08 01:39:36,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-08 01:39:36,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:36,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:36,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:39:36,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:39:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 01:39:36,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:39:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300631371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:39:36,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:39:36,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:39:36,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070250981] [2025-03-08 01:39:36,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:39:36,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:39:36,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:39:36,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:39:36,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:39:36,780 INFO L87 Difference]: Start difference. First operand 838 states and 1039 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-08 01:39:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:39:37,155 INFO L93 Difference]: Finished difference Result 2091 states and 2637 transitions. [2025-03-08 01:39:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:39:37,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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 353 [2025-03-08 01:39:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:39:37,160 INFO L225 Difference]: With dead ends: 2091 [2025-03-08 01:39:37,160 INFO L226 Difference]: Without dead ends: 1394 [2025-03-08 01:39:37,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:39:37,161 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:39:37,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 195 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:39:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-08 01:39:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2025-03-08 01:39:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.198851399856425) internal successors, (1670), 1393 states have internal predecessors, (1670), 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-08 01:39:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1670 transitions. [2025-03-08 01:39:37,183 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1670 transitions. Word has length 353 [2025-03-08 01:39:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:39:37,183 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1670 transitions. [2025-03-08 01:39:37,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-08 01:39:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1670 transitions. [2025-03-08 01:39:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-08 01:39:37,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:39:37,188 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:37,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 01:39:37,392 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,SelfDestructingSolverStorable6 [2025-03-08 01:39:37,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:39:37,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:39:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1902189872, now seen corresponding path program 1 times [2025-03-08 01:39:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:39:37,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982290500] [2025-03-08 01:39:37,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:39:37,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-08 01:39:37,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-08 01:39:37,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:37,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-08 01:39:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:39:37,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982290500] [2025-03-08 01:39:37,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982290500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:39:37,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:39:37,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:39:37,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648302523] [2025-03-08 01:39:37,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:39:37,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:39:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:39:37,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:39:37,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:39:37,644 INFO L87 Difference]: Start difference. First operand 1394 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-08 01:39:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:39:38,087 INFO L93 Difference]: Finished difference Result 3064 states and 3736 transitions. [2025-03-08 01:39:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:39:38,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 366 [2025-03-08 01:39:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:39:38,093 INFO L225 Difference]: With dead ends: 3064 [2025-03-08 01:39:38,093 INFO L226 Difference]: Without dead ends: 1811 [2025-03-08 01:39:38,095 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-08 01:39:38,095 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 89 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:39:38,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 225 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:39:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-03-08 01:39:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1672. [2025-03-08 01:39:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.1807301017354876) internal successors, (1973), 1671 states have internal predecessors, (1973), 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-08 01:39:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1973 transitions. [2025-03-08 01:39:38,120 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1973 transitions. Word has length 366 [2025-03-08 01:39:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:39:38,120 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1973 transitions. [2025-03-08 01:39:38,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-08 01:39:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1973 transitions. [2025-03-08 01:39:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-08 01:39:38,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:39:38,123 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:38,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:39:38,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:39:38,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:39:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash 418629022, now seen corresponding path program 1 times [2025-03-08 01:39:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:39:38,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907827151] [2025-03-08 01:39:38,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:39:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:39:38,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-08 01:39:38,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 01:39:38,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:39:38,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:39:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-08 01:39:38,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:39:38,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907827151] [2025-03-08 01:39:38,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907827151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:39:38,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:39:38,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:39:38,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424140493] [2025-03-08 01:39:38,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:39:38,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:39:38,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:39:38,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:39:38,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:39:38,595 INFO L87 Difference]: Start difference. First operand 1672 states and 1973 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 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-08 01:39:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:39:38,898 INFO L93 Difference]: Finished difference Result 3068 states and 3617 transitions. [2025-03-08 01:39:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:39:38,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 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 367 [2025-03-08 01:39:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:39:38,900 INFO L225 Difference]: With dead ends: 3068 [2025-03-08 01:39:38,900 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:39:38,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:39:38,902 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:39:38,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 12 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:39:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:39:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:39:38,903 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-08 01:39:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:39:38,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 367 [2025-03-08 01:39:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:39:38,903 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:39:38,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 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-08 01:39:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:39:38,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:39:38,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:39:38,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:39:38,908 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:39:38,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:39:39,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 01:39:39,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:39:39 BoogieIcfgContainer [2025-03-08 01:39:39,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 01:39:39,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 01:39:39,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 01:39:39,018 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 01:39:39,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:29" (3/4) ... [2025-03-08 01:39:39,020 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 01:39:39,033 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 01:39:39,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 01:39:39,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 01:39:39,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 01:39:39,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 01:39:39,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 01:39:39,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 01:39:39,130 INFO L158 Benchmark]: Toolchain (without parser) took 10600.65ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 103.6MB in the beginning and 322.5MB in the end (delta: -218.9MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2025-03-08 01:39:39,130 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 01:39:39,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.53ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 74.9MB in the end (delta: 28.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 01:39:39,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.45ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 67.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:39:39,130 INFO L158 Benchmark]: Boogie Preprocessor took 84.83ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 59.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:39:39,131 INFO L158 Benchmark]: IcfgBuilder took 951.44ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 96.3MB in the end (delta: -37.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-03-08 01:39:39,131 INFO L158 Benchmark]: TraceAbstraction took 9041.02ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 95.8MB in the beginning and 330.7MB in the end (delta: -234.8MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2025-03-08 01:39:39,131 INFO L158 Benchmark]: Witness Printer took 111.23ms. Allocated memory is still 419.4MB. Free memory was 330.7MB in the beginning and 322.5MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:39:39,133 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.31ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.53ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 74.9MB in the end (delta: 28.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.45ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 67.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.83ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 59.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 951.44ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 96.3MB in the end (delta: -37.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9041.02ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 95.8MB in the beginning and 330.7MB in the end (delta: -234.8MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * Witness Printer took 111.23ms. Allocated memory is still 419.4MB. Free memory was 330.7MB in the beginning and 322.5MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 173]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 343 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1105 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1105 mSDsluCounter, 1068 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4374 IncrementalHoareTripleChecker+Invalid, 5027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 653 mSolverCounterUnsat, 997 mSDtfsCounter, 4374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 673 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1672occurred in iteration=8, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 278 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3046 NumberOfCodeBlocks, 3046 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3035 ConstructedInterpolants, 0 QuantifiedInterpolants, 13192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 872 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 2616/2756 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 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: (((((((a10 == 0) && (14 == a4)) && (((long long) a1 + 551894) <= 0)) && (a12 == 0)) || (((a19 != 6) && (14 == a4)) && (a12 == 0))) || (((a10 == 3) && (14 == a4)) && (a12 == 0))) || (((a10 == 4) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 01:39:39,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE