./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label21.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 d5ae1d248ac328ae194d38c847eaaf19b85e7124a7cd6c7e1aa145a759bc08e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:49:05,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:49:05,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:49:05,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:49:05,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:49:05,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:49:05,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:49:05,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:49:05,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:49:05,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:49:05,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:49:05,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:49:05,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:49:05,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:49:05,625 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:49:05,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:49:05,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:49:05,625 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:49:05,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:49:05,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:49:05,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:49:05,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:49:05,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:49:05,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:49:05,626 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:49:05,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:49:05,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:49:05,626 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:49:05,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:49:05,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:05,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:49:05,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:49:05,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:49:05,628 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 -> d5ae1d248ac328ae194d38c847eaaf19b85e7124a7cd6c7e1aa145a759bc08e1 [2025-03-16 14:49:05,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:49:05,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:49:05,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:49:05,866 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:49:05,866 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:49:05,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2025-03-16 14:49:07,004 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbdbe3826/c1370a3f654a430fa246841fe46e0d51/FLAGf7e494866 [2025-03-16 14:49:07,322 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:49:07,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2025-03-16 14:49:07,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbdbe3826/c1370a3f654a430fa246841fe46e0d51/FLAGf7e494866 [2025-03-16 14:49:07,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbdbe3826/c1370a3f654a430fa246841fe46e0d51 [2025-03-16 14:49:07,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:49:07,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:49:07,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:07,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:49:07,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:49:07,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1b8949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07, skipping insertion in model container [2025-03-16 14:49:07,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:49:07,534 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_label21.c[3267,3280] [2025-03-16 14:49:07,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:07,630 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:49:07,642 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_label21.c[3267,3280] [2025-03-16 14:49:07,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:07,709 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:49:07,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07 WrapperNode [2025-03-16 14:49:07,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:07,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:07,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:49:07,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:49:07,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,792 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-16 14:49:07,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:07,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:49:07,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:49:07,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:49:07,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,833 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-16 14:49:07,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:49:07,880 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:49:07,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:49:07,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:49:07,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (1/1) ... [2025-03-16 14:49:07,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:07,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:49:07,907 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-16 14:49:07,912 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-16 14:49:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:49:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:49:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:49:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:49:07,969 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:49:07,970 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:49:08,653 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 14:49:08,653 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:49:08,662 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:49:08,662 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:49:08,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:08 BoogieIcfgContainer [2025-03-16 14:49:08,663 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:49:08,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:49:08,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:49:08,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:49:08,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:49:07" (1/3) ... [2025-03-16 14:49:08,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15918868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:08, skipping insertion in model container [2025-03-16 14:49:08,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:07" (2/3) ... [2025-03-16 14:49:08,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15918868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:08, skipping insertion in model container [2025-03-16 14:49:08,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:08" (3/3) ... [2025-03-16 14:49:08,703 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label21.c [2025-03-16 14:49:08,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:49:08,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label21.c that has 1 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:49:08,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:49:08,770 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;@34fda09a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:49:08,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:49:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.972027972027972) internal successors, (282), 144 states have internal predecessors, (282), 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-16 14:49:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 14:49:08,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:08,779 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] [2025-03-16 14:49:08,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:08,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash 24732228, now seen corresponding path program 1 times [2025-03-16 14:49:08,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707471491] [2025-03-16 14:49:08,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:08,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:08,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 14:49:08,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 14:49:08,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:08,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:08,892 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-16 14:49:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707471491] [2025-03-16 14:49:08,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707471491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:08,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:08,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371608248] [2025-03-16 14:49:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:08,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:49:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:08,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:49:08,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:49:08,917 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.972027972027972) internal successors, (282), 144 states have internal predecessors, (282), 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 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-16 14:49:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:08,945 INFO L93 Difference]: Finished difference Result 289 states and 563 transitions. [2025-03-16 14:49:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:49:08,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 26 [2025-03-16 14:49:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:08,953 INFO L225 Difference]: With dead ends: 289 [2025-03-16 14:49:08,954 INFO L226 Difference]: Without dead ends: 142 [2025-03-16 14:49:08,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:49:08,960 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:08,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:49:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-16 14:49:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-16 14:49:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 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-16 14:49:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2025-03-16 14:49:08,996 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 26 [2025-03-16 14:49:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:08,996 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2025-03-16 14:49:08,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-16 14:49:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2025-03-16 14:49:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 14:49:08,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:08,997 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] [2025-03-16 14:49:09,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:49:09,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:09,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2026816709, now seen corresponding path program 1 times [2025-03-16 14:49:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:09,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302661281] [2025-03-16 14:49:09,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:09,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 14:49:09,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 14:49:09,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:09,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:09,139 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-16 14:49:09,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:09,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302661281] [2025-03-16 14:49:09,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302661281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:09,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:09,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425338964] [2025-03-16 14:49:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:09,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:09,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:09,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:09,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:09,141 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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-16 14:49:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:09,629 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2025-03-16 14:49:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:09,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 26 [2025-03-16 14:49:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:09,631 INFO L225 Difference]: With dead ends: 283 [2025-03-16 14:49:09,631 INFO L226 Difference]: Without dead ends: 281 [2025-03-16 14:49:09,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:09,632 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 157 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:09,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 10 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:49:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-16 14:49:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-16 14:49:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 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-16 14:49:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2025-03-16 14:49:09,646 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 26 [2025-03-16 14:49:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:09,646 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2025-03-16 14:49:09,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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-16 14:49:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2025-03-16 14:49:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 14:49:09,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:09,648 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:49:09,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:49:09,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:09,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:09,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1557545823, now seen corresponding path program 1 times [2025-03-16 14:49:09,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:09,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820596124] [2025-03-16 14:49:09,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:09,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:09,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 14:49:09,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 14:49:09,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:09,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:09,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820596124] [2025-03-16 14:49:09,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820596124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:09,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:09,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544698424] [2025-03-16 14:49:09,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:09,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:09,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:09,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:09,864 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-16 14:49:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:10,339 INFO L93 Difference]: Finished difference Result 700 states and 1075 transitions. [2025-03-16 14:49:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2025-03-16 14:49:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:10,342 INFO L225 Difference]: With dead ends: 700 [2025-03-16 14:49:10,343 INFO L226 Difference]: Without dead ends: 420 [2025-03-16 14:49:10,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:10,345 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:10,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 33 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:49:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-16 14:49:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-16 14:49:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4200477326968974) internal successors, (595), 419 states have internal predecessors, (595), 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-16 14:49:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 595 transitions. [2025-03-16 14:49:10,368 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 595 transitions. Word has length 95 [2025-03-16 14:49:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:10,369 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 595 transitions. [2025-03-16 14:49:10,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-16 14:49:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 595 transitions. [2025-03-16 14:49:10,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 14:49:10,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:10,371 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-03-16 14:49:10,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:49:10,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:10,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2083305934, now seen corresponding path program 1 times [2025-03-16 14:49:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:10,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840649724] [2025-03-16 14:49:10,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:10,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:10,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 14:49:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 14:49:10,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:10,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:10,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:10,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840649724] [2025-03-16 14:49:10,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840649724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:10,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:10,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:49:10,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949120822] [2025-03-16 14:49:10,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:10,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:10,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:10,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:10,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:10,505 INFO L87 Difference]: Start difference. First operand 420 states and 595 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-16 14:49:10,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:10,902 INFO L93 Difference]: Finished difference Result 561 states and 786 transitions. [2025-03-16 14:49:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:10,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-03-16 14:49:10,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:10,904 INFO L225 Difference]: With dead ends: 561 [2025-03-16 14:49:10,905 INFO L226 Difference]: Without dead ends: 559 [2025-03-16 14:49:10,905 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-16 14:49:10,905 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 156 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:10,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 10 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:49:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-16 14:49:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 420. [2025-03-16 14:49:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4200477326968974) internal successors, (595), 419 states have internal predecessors, (595), 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-16 14:49:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 595 transitions. [2025-03-16 14:49:10,920 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 595 transitions. Word has length 101 [2025-03-16 14:49:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:10,920 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 595 transitions. [2025-03-16 14:49:10,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-16 14:49:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 595 transitions. [2025-03-16 14:49:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 14:49:10,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:10,926 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:10,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:49:10,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash 971122569, now seen corresponding path program 1 times [2025-03-16 14:49:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:10,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358408045] [2025-03-16 14:49:10,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:10,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:10,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 14:49:10,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 14:49:10,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:10,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:11,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:11,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358408045] [2025-03-16 14:49:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358408045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:11,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:11,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:11,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150210180] [2025-03-16 14:49:11,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:11,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:11,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:11,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:11,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:11,065 INFO L87 Difference]: Start difference. First operand 420 states and 595 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-16 14:49:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:11,515 INFO L93 Difference]: Finished difference Result 1256 states and 1782 transitions. [2025-03-16 14:49:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:11,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 104 [2025-03-16 14:49:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:11,518 INFO L225 Difference]: With dead ends: 1256 [2025-03-16 14:49:11,518 INFO L226 Difference]: Without dead ends: 837 [2025-03-16 14:49:11,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:11,520 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:11,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 30 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:49:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-03-16 14:49:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 698. [2025-03-16 14:49:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.3888091822094693) internal successors, (968), 697 states have internal predecessors, (968), 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-16 14:49:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 968 transitions. [2025-03-16 14:49:11,533 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 968 transitions. Word has length 104 [2025-03-16 14:49:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:11,533 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 968 transitions. [2025-03-16 14:49:11,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-16 14:49:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 968 transitions. [2025-03-16 14:49:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 14:49:11,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:11,536 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:11,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:49:11,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:11,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2113003087, now seen corresponding path program 1 times [2025-03-16 14:49:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130809411] [2025-03-16 14:49:11,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:11,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 14:49:11,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 14:49:11,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:11,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130809411] [2025-03-16 14:49:11,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130809411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:11,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:11,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:11,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199469697] [2025-03-16 14:49:11,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:11,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:11,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:11,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:11,664 INFO L87 Difference]: Start difference. First operand 698 states and 968 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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-16 14:49:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:12,034 INFO L93 Difference]: Finished difference Result 1951 states and 2711 transitions. [2025-03-16 14:49:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:12,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2025-03-16 14:49:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:12,039 INFO L225 Difference]: With dead ends: 1951 [2025-03-16 14:49:12,039 INFO L226 Difference]: Without dead ends: 1254 [2025-03-16 14:49:12,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:12,041 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:12,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 75 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-16 14:49:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1115. [2025-03-16 14:49:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2881508078994615) internal successors, (1435), 1114 states have internal predecessors, (1435), 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-16 14:49:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1435 transitions. [2025-03-16 14:49:12,062 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1435 transitions. Word has length 120 [2025-03-16 14:49:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:12,062 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1435 transitions. [2025-03-16 14:49:12,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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-16 14:49:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1435 transitions. [2025-03-16 14:49:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 14:49:12,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:12,065 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, 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] [2025-03-16 14:49:12,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:49:12,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:12,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1888005934, now seen corresponding path program 1 times [2025-03-16 14:49:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:12,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457249652] [2025-03-16 14:49:12,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:12,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:12,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 14:49:12,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 14:49:12,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:12,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:12,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:12,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457249652] [2025-03-16 14:49:12,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457249652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:12,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:12,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 14:49:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879303575] [2025-03-16 14:49:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:12,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:49:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:12,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:49:12,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:49:12,423 INFO L87 Difference]: Start difference. First operand 1115 states and 1435 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 6 states have internal predecessors, (179), 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-16 14:49:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:12,793 INFO L93 Difference]: Finished difference Result 2284 states and 2924 transitions. [2025-03-16 14:49:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:49:12,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 6 states have internal predecessors, (179), 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 179 [2025-03-16 14:49:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:12,798 INFO L225 Difference]: With dead ends: 2284 [2025-03-16 14:49:12,798 INFO L226 Difference]: Without dead ends: 1115 [2025-03-16 14:49:12,800 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-16 14:49:12,801 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:12,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 21 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-16 14:49:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-03-16 14:49:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2809694793536803) internal successors, (1427), 1114 states have internal predecessors, (1427), 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-16 14:49:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1427 transitions. [2025-03-16 14:49:12,825 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1427 transitions. Word has length 179 [2025-03-16 14:49:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:12,825 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1427 transitions. [2025-03-16 14:49:12,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 6 states have internal predecessors, (179), 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-16 14:49:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1427 transitions. [2025-03-16 14:49:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 14:49:12,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:12,827 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:12,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:49:12,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:12,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash -93754793, now seen corresponding path program 1 times [2025-03-16 14:49:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497679810] [2025-03-16 14:49:12,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:12,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 14:49:12,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 14:49:12,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:12,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:12,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497679810] [2025-03-16 14:49:12,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497679810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:12,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:12,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:49:12,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673140975] [2025-03-16 14:49:12,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:12,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:12,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:12,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:12,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:12,997 INFO L87 Difference]: Start difference. First operand 1115 states and 1427 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-16 14:49:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:13,380 INFO L93 Difference]: Finished difference Result 2646 states and 3408 transitions. [2025-03-16 14:49:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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 186 [2025-03-16 14:49:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:13,386 INFO L225 Difference]: With dead ends: 2646 [2025-03-16 14:49:13,386 INFO L226 Difference]: Without dead ends: 1532 [2025-03-16 14:49:13,387 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-16 14:49:13,388 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:13,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 212 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:49:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-03-16 14:49:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1115. [2025-03-16 14:49:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.272890484739677) internal successors, (1418), 1114 states have internal predecessors, (1418), 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-16 14:49:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1418 transitions. [2025-03-16 14:49:13,406 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1418 transitions. Word has length 186 [2025-03-16 14:49:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:13,406 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1418 transitions. [2025-03-16 14:49:13,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-16 14:49:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1418 transitions. [2025-03-16 14:49:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 14:49:13,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:13,411 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, 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, 1, 1, 1] [2025-03-16 14:49:13,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:49:13,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:13,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1091814672, now seen corresponding path program 1 times [2025-03-16 14:49:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:13,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343685516] [2025-03-16 14:49:13,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:13,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 14:49:13,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 14:49:13,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:13,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 14:49:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:13,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343685516] [2025-03-16 14:49:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343685516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:13,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:13,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000047620] [2025-03-16 14:49:13,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:13,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:13,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:13,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:13,616 INFO L87 Difference]: Start difference. First operand 1115 states and 1418 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 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-16 14:49:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:13,962 INFO L93 Difference]: Finished difference Result 2368 states and 2983 transitions. [2025-03-16 14:49:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:13,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 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 196 [2025-03-16 14:49:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:13,966 INFO L225 Difference]: With dead ends: 2368 [2025-03-16 14:49:13,966 INFO L226 Difference]: Without dead ends: 1254 [2025-03-16 14:49:13,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:13,968 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:13,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 81 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-16 14:49:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2025-03-16 14:49:14,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.2458100558659218) internal successors, (1561), 1253 states have internal predecessors, (1561), 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-16 14:49:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1561 transitions. [2025-03-16 14:49:14,003 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1561 transitions. Word has length 196 [2025-03-16 14:49:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:14,003 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1561 transitions. [2025-03-16 14:49:14,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 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-16 14:49:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1561 transitions. [2025-03-16 14:49:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-16 14:49:14,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:14,005 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:14,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:49:14,006 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:14,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1881602580, now seen corresponding path program 1 times [2025-03-16 14:49:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505612779] [2025-03-16 14:49:14,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:14,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 14:49:14,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 14:49:14,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:14,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:14,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:14,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505612779] [2025-03-16 14:49:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505612779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:14,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:14,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:49:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900086413] [2025-03-16 14:49:14,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:14,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:14,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:14,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:14,157 INFO L87 Difference]: Start difference. First operand 1254 states and 1561 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-16 14:49:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:14,523 INFO L93 Difference]: Finished difference Result 2785 states and 3533 transitions. [2025-03-16 14:49:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:14,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 215 [2025-03-16 14:49:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:14,528 INFO L225 Difference]: With dead ends: 2785 [2025-03-16 14:49:14,529 INFO L226 Difference]: Without dead ends: 1671 [2025-03-16 14:49:14,530 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-16 14:49:14,530 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:14,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 188 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-03-16 14:49:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1532. [2025-03-16 14:49:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.1698236446766819) internal successors, (1791), 1531 states have internal predecessors, (1791), 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-16 14:49:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1791 transitions. [2025-03-16 14:49:14,553 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1791 transitions. Word has length 215 [2025-03-16 14:49:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:14,553 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1791 transitions. [2025-03-16 14:49:14,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-16 14:49:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1791 transitions. [2025-03-16 14:49:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-16 14:49:14,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:14,557 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:14,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:49:14,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:14,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:14,558 INFO L85 PathProgramCache]: Analyzing trace with hash 532491377, now seen corresponding path program 1 times [2025-03-16 14:49:14,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:14,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845830540] [2025-03-16 14:49:14,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:14,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:14,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-16 14:49:14,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-16 14:49:14,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:14,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-16 14:49:14,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:14,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845830540] [2025-03-16 14:49:14,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845830540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:14,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:14,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:49:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233052950] [2025-03-16 14:49:14,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:14,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:14,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:14,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:14,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:14,913 INFO L87 Difference]: Start difference. First operand 1532 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-16 14:49:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:15,241 INFO L93 Difference]: Finished difference Result 1810 states and 2094 transitions. [2025-03-16 14:49:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:15,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 325 [2025-03-16 14:49:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:15,242 INFO L225 Difference]: With dead ends: 1810 [2025-03-16 14:49:15,242 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:49:15,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 14:49:15,244 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 156 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:15,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 7 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:49:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:49:15,244 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-16 14:49:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:49:15,244 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 325 [2025-03-16 14:49:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:15,244 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:49:15,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-16 14:49:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:49:15,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:49:15,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:49:15,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:49:15,254 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:15,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:49:15,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:49:15,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:49:15 BoogieIcfgContainer [2025-03-16 14:49:15,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:49:15,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:49:15,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:49:15,405 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:49:15,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:08" (3/4) ... [2025-03-16 14:49:15,407 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:49:15,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:49:15,420 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:49:15,420 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:49:15,420 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:49:15,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:49:15,519 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:49:15,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:49:15,519 INFO L158 Benchmark]: Toolchain (without parser) took 8154.22ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 110.9MB in the beginning and 80.1MB in the end (delta: 30.8MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2025-03-16 14:49:15,520 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:49:15,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.82ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 83.2MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:49:15,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.70ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 75.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:15,520 INFO L158 Benchmark]: Boogie Preprocessor took 85.86ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 66.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:15,520 INFO L158 Benchmark]: IcfgBuilder took 783.00ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 49.4MB in the end (delta: 17.4MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2025-03-16 14:49:15,521 INFO L158 Benchmark]: TraceAbstraction took 6739.97ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 48.8MB in the beginning and 90.7MB in the end (delta: -41.9MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:15,522 INFO L158 Benchmark]: Witness Printer took 113.95ms. Allocated memory is still 218.1MB. Free memory was 90.7MB in the beginning and 80.1MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:15,524 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.30ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.82ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 83.2MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.70ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 75.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.86ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 66.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 783.00ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 49.4MB in the end (delta: 17.4MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6739.97ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 48.8MB in the beginning and 90.7MB in the end (delta: -41.9MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * Witness Printer took 113.95ms. Allocated memory is still 218.1MB. Free memory was 90.7MB in the beginning and 80.1MB in the end (delta: 10.5MB). 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: 95]: 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, 145 locations, 282 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1007 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1007 mSDsluCounter, 887 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3745 IncrementalHoareTripleChecker+Invalid, 4304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 559 mSolverCounterUnsat, 841 mSDtfsCounter, 3745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1532occurred in iteration=10, InterpolantAutomatonStates: 36, 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, 11 MinimizatonAttempts, 973 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1573 NumberOfCodeBlocks, 1573 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1562 ConstructedInterpolants, 0 QuantifiedInterpolants, 4059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 914/914 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)) && (7 != a19)) && (a12 == 0)) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (7 != a19)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:49:15,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE