./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label16.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/Problem16_label16.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 6a9abcfae74a76ffd8cfeb07527f27fd22a6ecfb39955551233acb9bdc6f8719 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:12:51,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:12:51,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:12:51,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:12:51,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:12:51,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:12:51,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:12:51,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:12:51,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:12:51,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:12:51,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:12:51,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:12:51,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:12:51,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:12:51,154 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:12:51,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:12:51,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:12:51,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:12:51,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:12:51,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:12:51,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:12:51,156 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:12:51,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:12:51,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:12:51,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:12:51,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:12:51,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:12:51,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:12:51,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:12:51,156 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 -> 6a9abcfae74a76ffd8cfeb07527f27fd22a6ecfb39955551233acb9bdc6f8719 [2025-03-16 15:12:51,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:12:51,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:12:51,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:12:51,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:12:51,364 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:12:51,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label16.c [2025-03-16 15:12:52,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1730e64/6c205d7afc764e818470fb23f21b4433/FLAGab0fe98b3 [2025-03-16 15:12:52,817 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:12:52,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label16.c [2025-03-16 15:12:52,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1730e64/6c205d7afc764e818470fb23f21b4433/FLAGab0fe98b3 [2025-03-16 15:12:53,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1730e64/6c205d7afc764e818470fb23f21b4433 [2025-03-16 15:12:53,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:12:53,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:12:53,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:12:53,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:12:53,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:12:53,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bf3a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53, skipping insertion in model container [2025-03-16 15:12:53,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:12:53,226 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/Problem16_label16.c[4534,4547] [2025-03-16 15:12:53,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:12:53,510 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:12:53,525 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/Problem16_label16.c[4534,4547] [2025-03-16 15:12:53,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:12:53,642 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:12:53,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53 WrapperNode [2025-03-16 15:12:53,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:12:53,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:12:53,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:12:53,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:12:53,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,758 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:12:53,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:12:53,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:12:53,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:12:53,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:12:53,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,864 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 15:12:53,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:12:53,947 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:12:53,947 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:12:53,947 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:12:53,948 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (1/1) ... [2025-03-16 15:12:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:12:53,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:53,971 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 15:12:53,979 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 15:12:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:12:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:12:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:12:53,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:12:54,042 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:12:54,043 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:12:55,498 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:12:55,564 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:12:55,564 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:12:55,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:12:55,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:12:55,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:12:55 BoogieIcfgContainer [2025-03-16 15:12:55,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:12:55,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:12:55,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:12:55,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:12:55,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:12:53" (1/3) ... [2025-03-16 15:12:55,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b778389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:12:55, skipping insertion in model container [2025-03-16 15:12:55,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:53" (2/3) ... [2025-03-16 15:12:55,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b778389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:12:55, skipping insertion in model container [2025-03-16 15:12:55,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:12:55" (3/3) ... [2025-03-16 15:12:55,589 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label16.c [2025-03-16 15:12:55,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:12:55,603 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label16.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:12:55,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:12:55,668 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;@622685d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:12:55,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:12:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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 15:12:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 15:12:55,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:55,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:55,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:55,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash -465256642, now seen corresponding path program 1 times [2025-03-16 15:12:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:55,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639056225] [2025-03-16 15:12:55,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:55,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 15:12:55,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 15:12:55,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:55,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:55,794 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 15:12:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639056225] [2025-03-16 15:12:55,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639056225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:55,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:55,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:55,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021457599] [2025-03-16 15:12:55,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:55,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:12:55,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:55,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:12:55,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:12:55,819 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 15:12:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:55,866 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:12:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:12:55,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 41 [2025-03-16 15:12:55,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:55,874 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:12:55,875 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:12:55,878 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 15:12:55,882 INFO L435 NwaCegarLoop]: 599 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, 599 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 15:12:55,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:12:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:12:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:12:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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 15:12:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:12:55,923 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 41 [2025-03-16 15:12:55,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:55,924 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:12:55,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 15:12:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:12:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 15:12:55,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:55,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:55,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:12:55,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:55,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash -639178370, now seen corresponding path program 1 times [2025-03-16 15:12:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:55,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973257518] [2025-03-16 15:12:55,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:55,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:55,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 15:12:55,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 15:12:55,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:55,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:56,182 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 15:12:56,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:56,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973257518] [2025-03-16 15:12:56,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973257518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:56,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:56,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:56,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250976925] [2025-03-16 15:12:56,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:56,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:56,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:56,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:56,187 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 15:12:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:58,359 INFO L93 Difference]: Finished difference Result 1321 states and 2379 transitions. [2025-03-16 15:12:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:12:58,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2025-03-16 15:12:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:58,368 INFO L225 Difference]: With dead ends: 1321 [2025-03-16 15:12:58,368 INFO L226 Difference]: Without dead ends: 990 [2025-03-16 15:12:58,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:12:58,370 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 934 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:58,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 276 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:12:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-16 15:12:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2025-03-16 15:12:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.4863498483316482) internal successors, (1470), 989 states have internal predecessors, (1470), 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 15:12:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1470 transitions. [2025-03-16 15:12:58,410 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1470 transitions. Word has length 41 [2025-03-16 15:12:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:58,410 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1470 transitions. [2025-03-16 15:12:58,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 15:12:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1470 transitions. [2025-03-16 15:12:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 15:12:58,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:58,414 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:58,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:12:58,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -20710700, now seen corresponding path program 1 times [2025-03-16 15:12:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:58,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233478746] [2025-03-16 15:12:58,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:58,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 15:12:58,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 15:12:58,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:58,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 15:12:58,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:58,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233478746] [2025-03-16 15:12:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233478746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448985914] [2025-03-16 15:12:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:58,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:58,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:58,632 INFO L87 Difference]: Start difference. First operand 990 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:59,653 INFO L93 Difference]: Finished difference Result 2308 states and 3725 transitions. [2025-03-16 15:12:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:59,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-03-16 15:12:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:59,659 INFO L225 Difference]: With dead ends: 2308 [2025-03-16 15:12:59,660 INFO L226 Difference]: Without dead ends: 1648 [2025-03-16 15:12:59,663 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 15:12:59,664 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 280 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:59,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 198 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:12:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-16 15:12:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2025-03-16 15:12:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.379477838494232) internal successors, (2272), 1647 states have internal predecessors, (2272), 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 15:12:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2272 transitions. [2025-03-16 15:12:59,694 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2272 transitions. Word has length 128 [2025-03-16 15:12:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:59,694 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2272 transitions. [2025-03-16 15:12:59,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2272 transitions. [2025-03-16 15:12:59,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-16 15:12:59,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:59,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:12:59,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:12:59,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:59,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -174120494, now seen corresponding path program 1 times [2025-03-16 15:12:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850997010] [2025-03-16 15:12:59,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:59,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 15:12:59,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 15:12:59,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:59,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:12:59,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:59,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850997010] [2025-03-16 15:12:59,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850997010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:59,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:59,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066286126] [2025-03-16 15:12:59,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:59,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:59,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:59,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:59,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:59,925 INFO L87 Difference]: Start difference. First operand 1648 states and 2272 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 15:13:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:00,941 INFO L93 Difference]: Finished difference Result 4282 states and 6131 transitions. [2025-03-16 15:13:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:00,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 207 [2025-03-16 15:13:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:00,949 INFO L225 Difference]: With dead ends: 4282 [2025-03-16 15:13:00,950 INFO L226 Difference]: Without dead ends: 2964 [2025-03-16 15:13:00,951 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 15:13:00,952 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:00,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:13:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2025-03-16 15:13:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2635. [2025-03-16 15:13:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.340167046317388) internal successors, (3530), 2634 states have internal predecessors, (3530), 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 15:13:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3530 transitions. [2025-03-16 15:13:00,994 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3530 transitions. Word has length 207 [2025-03-16 15:13:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:00,994 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3530 transitions. [2025-03-16 15:13:00,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 15:13:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3530 transitions. [2025-03-16 15:13:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-16 15:13:00,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:00,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:00,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:13:00,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:00,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1808609840, now seen corresponding path program 1 times [2025-03-16 15:13:00,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:00,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114070250] [2025-03-16 15:13:00,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:00,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:01,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-16 15:13:01,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-16 15:13:01,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:01,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 15:13:01,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:01,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114070250] [2025-03-16 15:13:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114070250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:01,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667892480] [2025-03-16 15:13:01,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:01,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:01,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:01,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:01,185 INFO L87 Difference]: Start difference. First operand 2635 states and 3530 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 2 states have internal predecessors, (244), 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 15:13:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:02,077 INFO L93 Difference]: Finished difference Result 5598 states and 7526 transitions. [2025-03-16 15:13:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:02,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 2 states have internal predecessors, (244), 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 283 [2025-03-16 15:13:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:02,086 INFO L225 Difference]: With dead ends: 5598 [2025-03-16 15:13:02,086 INFO L226 Difference]: Without dead ends: 3293 [2025-03-16 15:13:02,088 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 15:13:02,088 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:02,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 76 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:13:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2025-03-16 15:13:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3293. [2025-03-16 15:13:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3293 states, 3292 states have (on average 1.2247873633049817) internal successors, (4032), 3292 states have internal predecessors, (4032), 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 15:13:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4032 transitions. [2025-03-16 15:13:02,130 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4032 transitions. Word has length 283 [2025-03-16 15:13:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:02,130 INFO L471 AbstractCegarLoop]: Abstraction has 3293 states and 4032 transitions. [2025-03-16 15:13:02,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 2 states have internal predecessors, (244), 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 15:13:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4032 transitions. [2025-03-16 15:13:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-16 15:13:02,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:02,138 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:13:02,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:13:02,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:02,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1252755173, now seen corresponding path program 1 times [2025-03-16 15:13:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136333541] [2025-03-16 15:13:02,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:02,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-16 15:13:02,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-16 15:13:02,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:02,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-16 15:13:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136333541] [2025-03-16 15:13:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136333541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:02,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040359496] [2025-03-16 15:13:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:02,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:02,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:02,421 INFO L87 Difference]: Start difference. First operand 3293 states and 4032 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 15:13:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:03,299 INFO L93 Difference]: Finished difference Result 6585 states and 8075 transitions. [2025-03-16 15:13:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:03,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 460 [2025-03-16 15:13:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:03,306 INFO L225 Difference]: With dead ends: 6585 [2025-03-16 15:13:03,307 INFO L226 Difference]: Without dead ends: 3293 [2025-03-16 15:13:03,309 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 15:13:03,310 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 288 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:03,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 536 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:13:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2025-03-16 15:13:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3293. [2025-03-16 15:13:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3293 states, 3292 states have (on average 1.0568043742405833) internal successors, (3479), 3292 states have internal predecessors, (3479), 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 15:13:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 3479 transitions. [2025-03-16 15:13:03,355 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 3479 transitions. Word has length 460 [2025-03-16 15:13:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:03,355 INFO L471 AbstractCegarLoop]: Abstraction has 3293 states and 3479 transitions. [2025-03-16 15:13:03,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 15:13:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 3479 transitions. [2025-03-16 15:13:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-16 15:13:03,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:03,362 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:03,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:13:03,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:03,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1960967525, now seen corresponding path program 1 times [2025-03-16 15:13:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134255244] [2025-03-16 15:13:03,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:03,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-16 15:13:03,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-16 15:13:03,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:03,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 15:13:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134255244] [2025-03-16 15:13:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134255244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:04,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:04,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:04,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150564744] [2025-03-16 15:13:04,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:04,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:04,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:04,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:04,073 INFO L87 Difference]: Start difference. First operand 3293 states and 3479 transitions. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 3 states have internal predecessors, (473), 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 15:13:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:04,715 INFO L93 Difference]: Finished difference Result 6585 states and 6969 transitions. [2025-03-16 15:13:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:04,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 3 states have internal predecessors, (473), 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 512 [2025-03-16 15:13:04,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:04,723 INFO L225 Difference]: With dead ends: 6585 [2025-03-16 15:13:04,724 INFO L226 Difference]: Without dead ends: 3622 [2025-03-16 15:13:04,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:04,727 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 300 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:04,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 112 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-16 15:13:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3622. [2025-03-16 15:13:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3621 states have (on average 1.0527478597072633) internal successors, (3812), 3621 states have internal predecessors, (3812), 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 15:13:04,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 3812 transitions. [2025-03-16 15:13:04,784 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 3812 transitions. Word has length 512 [2025-03-16 15:13:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:04,785 INFO L471 AbstractCegarLoop]: Abstraction has 3622 states and 3812 transitions. [2025-03-16 15:13:04,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 3 states have internal predecessors, (473), 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 15:13:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 3812 transitions. [2025-03-16 15:13:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-16 15:13:04,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:04,793 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:04,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:13:04,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:04,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1632840725, now seen corresponding path program 1 times [2025-03-16 15:13:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:04,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499101086] [2025-03-16 15:13:04,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:04,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-16 15:13:04,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-16 15:13:04,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:04,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-16 15:13:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:05,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499101086] [2025-03-16 15:13:05,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499101086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:05,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:05,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:05,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256537118] [2025-03-16 15:13:05,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:05,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:05,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:05,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:05,255 INFO L87 Difference]: Start difference. First operand 3622 states and 3812 transitions. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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 15:13:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:05,927 INFO L93 Difference]: Finished difference Result 8230 states and 8740 transitions. [2025-03-16 15:13:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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 616 [2025-03-16 15:13:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:05,939 INFO L225 Difference]: With dead ends: 8230 [2025-03-16 15:13:05,939 INFO L226 Difference]: Without dead ends: 4938 [2025-03-16 15:13:05,942 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 15:13:05,943 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:05,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 39 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2025-03-16 15:13:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4938. [2025-03-16 15:13:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.056917156167713) internal successors, (5218), 4937 states have internal predecessors, (5218), 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 15:13:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 5218 transitions. [2025-03-16 15:13:05,982 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 5218 transitions. Word has length 616 [2025-03-16 15:13:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:05,983 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 5218 transitions. [2025-03-16 15:13:05,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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 15:13:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 5218 transitions. [2025-03-16 15:13:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2025-03-16 15:13:05,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:05,989 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:05,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:13:05,989 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:05,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1847109217, now seen corresponding path program 1 times [2025-03-16 15:13:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:05,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488616100] [2025-03-16 15:13:05,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:06,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 843 statements into 1 equivalence classes. [2025-03-16 15:13:06,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 843 of 843 statements. [2025-03-16 15:13:06,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:06,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-16 15:13:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488616100] [2025-03-16 15:13:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488616100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:06,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:06,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:06,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351113938] [2025-03-16 15:13:06,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:06,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:06,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:06,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:06,377 INFO L87 Difference]: Start difference. First operand 4938 states and 5218 transitions. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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 15:13:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:07,011 INFO L93 Difference]: Finished difference Result 10862 states and 11547 transitions. [2025-03-16 15:13:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:07,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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 843 [2025-03-16 15:13:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:07,025 INFO L225 Difference]: With dead ends: 10862 [2025-03-16 15:13:07,025 INFO L226 Difference]: Without dead ends: 6254 [2025-03-16 15:13:07,029 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 15:13:07,029 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:07,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 429 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2025-03-16 15:13:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 6254. [2025-03-16 15:13:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.0481368942907405) internal successors, (6554), 6253 states have internal predecessors, (6554), 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 15:13:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 6554 transitions. [2025-03-16 15:13:07,082 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 6554 transitions. Word has length 843 [2025-03-16 15:13:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 6554 transitions. [2025-03-16 15:13:07,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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 15:13:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 6554 transitions. [2025-03-16 15:13:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 891 [2025-03-16 15:13:07,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:07,091 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:07,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:13:07,091 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:07,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash 561800214, now seen corresponding path program 1 times [2025-03-16 15:13:07,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:07,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531162086] [2025-03-16 15:13:07,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:07,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:07,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 890 statements into 1 equivalence classes. [2025-03-16 15:13:07,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 890 of 890 statements. [2025-03-16 15:13:07,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:07,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 481 proven. 639 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2025-03-16 15:13:07,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:07,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531162086] [2025-03-16 15:13:07,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531162086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:07,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293017583] [2025-03-16 15:13:07,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:07,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:07,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:07,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:07,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:13:08,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 890 statements into 1 equivalence classes. [2025-03-16 15:13:08,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 890 of 890 statements. [2025-03-16 15:13:08,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:08,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:08,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:13:08,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 703 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2025-03-16 15:13:08,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293017583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:08,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:08,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:13:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023586604] [2025-03-16 15:13:08,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:08,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:08,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:08,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:08,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:08,432 INFO L87 Difference]: Start difference. First operand 6254 states and 6554 transitions. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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 15:13:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:08,967 INFO L93 Difference]: Finished difference Result 11849 states and 12443 transitions. [2025-03-16 15:13:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:08,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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 890 [2025-03-16 15:13:08,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:08,985 INFO L225 Difference]: With dead ends: 11849 [2025-03-16 15:13:08,985 INFO L226 Difference]: Without dead ends: 6254 [2025-03-16 15:13:08,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 890 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:08,990 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 180 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:08,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 375 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2025-03-16 15:13:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 6254. [2025-03-16 15:13:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.0426995042379659) internal successors, (6520), 6253 states have internal predecessors, (6520), 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 15:13:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 6520 transitions. [2025-03-16 15:13:09,046 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 6520 transitions. Word has length 890 [2025-03-16 15:13:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:09,047 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 6520 transitions. [2025-03-16 15:13:09,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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 15:13:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 6520 transitions. [2025-03-16 15:13:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1121 [2025-03-16 15:13:09,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:09,057 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 15:13:09,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:13:09,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 15:13:09,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:09,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1211697988, now seen corresponding path program 1 times [2025-03-16 15:13:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:09,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240130421] [2025-03-16 15:13:09,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:09,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:09,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1120 statements into 1 equivalence classes. [2025-03-16 15:13:09,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1120 of 1120 statements. [2025-03-16 15:13:09,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:09,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 1474 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2025-03-16 15:13:10,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:10,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240130421] [2025-03-16 15:13:10,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240130421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:10,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:10,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:13:10,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517259083] [2025-03-16 15:13:10,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:10,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:13:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:10,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:13:10,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:10,254 INFO L87 Difference]: Start difference. First operand 6254 states and 6520 transitions. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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 15:13:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:11,172 INFO L93 Difference]: Finished difference Result 12179 states and 12719 transitions. [2025-03-16 15:13:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:13:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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 1120 [2025-03-16 15:13:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:11,185 INFO L225 Difference]: With dead ends: 12179 [2025-03-16 15:13:11,185 INFO L226 Difference]: Without dead ends: 6584 [2025-03-16 15:13:11,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:11,191 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 357 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:11,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 564 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:13:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2025-03-16 15:13:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6583. [2025-03-16 15:13:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6583 states, 6582 states have (on average 1.0410209662716499) internal successors, (6852), 6582 states have internal predecessors, (6852), 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 15:13:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6583 states to 6583 states and 6852 transitions. [2025-03-16 15:13:11,241 INFO L78 Accepts]: Start accepts. Automaton has 6583 states and 6852 transitions. Word has length 1120 [2025-03-16 15:13:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:11,241 INFO L471 AbstractCegarLoop]: Abstraction has 6583 states and 6852 transitions. [2025-03-16 15:13:11,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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 15:13:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6583 states and 6852 transitions. [2025-03-16 15:13:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1135 [2025-03-16 15:13:11,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:11,254 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:13:11,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:13:11,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:11,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash 861332107, now seen corresponding path program 1 times [2025-03-16 15:13:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:11,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811728221] [2025-03-16 15:13:11,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:11,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:11,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1134 statements into 1 equivalence classes. [2025-03-16 15:13:11,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1134 of 1134 statements. [2025-03-16 15:13:11,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:11,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 1416 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2025-03-16 15:13:12,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:12,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811728221] [2025-03-16 15:13:12,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811728221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:12,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:12,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:13:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946440839] [2025-03-16 15:13:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:12,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:12,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:12,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:12,340 INFO L87 Difference]: Start difference. First operand 6583 states and 6852 transitions. Second operand has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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 15:13:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:13,084 INFO L93 Difference]: Finished difference Result 12514 states and 13046 transitions. [2025-03-16 15:13:13,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:13:13,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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 1134 [2025-03-16 15:13:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:13,094 INFO L225 Difference]: With dead ends: 12514 [2025-03-16 15:13:13,094 INFO L226 Difference]: Without dead ends: 6590 [2025-03-16 15:13:13,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:13,098 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 218 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:13,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 442 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:13:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2025-03-16 15:13:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 6583. [2025-03-16 15:13:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6583 states, 6582 states have (on average 1.0407171072622303) internal successors, (6850), 6582 states have internal predecessors, (6850), 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 15:13:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6583 states to 6583 states and 6850 transitions. [2025-03-16 15:13:13,145 INFO L78 Accepts]: Start accepts. Automaton has 6583 states and 6850 transitions. Word has length 1134 [2025-03-16 15:13:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:13,146 INFO L471 AbstractCegarLoop]: Abstraction has 6583 states and 6850 transitions. [2025-03-16 15:13:13,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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 15:13:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6583 states and 6850 transitions. [2025-03-16 15:13:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1149 [2025-03-16 15:13:13,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:13,156 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:13,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:13:13,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:13,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1950867428, now seen corresponding path program 1 times [2025-03-16 15:13:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:13,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186540369] [2025-03-16 15:13:13,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:13,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1148 statements into 1 equivalence classes. [2025-03-16 15:13:13,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1148 of 1148 statements. [2025-03-16 15:13:13,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:13,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2285 backedges. 1530 proven. 0 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2025-03-16 15:13:13,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:13,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186540369] [2025-03-16 15:13:13,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186540369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:13,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:13,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:13:13,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325261551] [2025-03-16 15:13:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:13,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:13,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:13,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:13,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:13,914 INFO L87 Difference]: Start difference. First operand 6583 states and 6850 transitions. Second operand has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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 15:13:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:14,625 INFO L93 Difference]: Finished difference Result 12836 states and 13378 transitions. [2025-03-16 15:13:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:13:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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 1148 [2025-03-16 15:13:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:14,636 INFO L225 Difference]: With dead ends: 12836 [2025-03-16 15:13:14,636 INFO L226 Difference]: Without dead ends: 6912 [2025-03-16 15:13:14,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:14,641 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:14,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 562 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:13:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6912 states. [2025-03-16 15:13:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6912 to 6912. [2025-03-16 15:13:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6912 states, 6911 states have (on average 1.0389234553610187) internal successors, (7180), 6911 states have internal predecessors, (7180), 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 15:13:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 7180 transitions. [2025-03-16 15:13:14,691 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 7180 transitions. Word has length 1148 [2025-03-16 15:13:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:14,692 INFO L471 AbstractCegarLoop]: Abstraction has 6912 states and 7180 transitions. [2025-03-16 15:13:14,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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 15:13:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 7180 transitions. [2025-03-16 15:13:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1258 [2025-03-16 15:13:14,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:14,703 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:14,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:13:14,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:14,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:14,704 INFO L85 PathProgramCache]: Analyzing trace with hash 85162512, now seen corresponding path program 1 times [2025-03-16 15:13:14,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:14,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859020113] [2025-03-16 15:13:14,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:14,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:14,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1257 statements into 1 equivalence classes. [2025-03-16 15:13:14,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1257 of 1257 statements. [2025-03-16 15:13:14,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:14,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3578 backedges. 2171 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2025-03-16 15:13:15,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:15,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859020113] [2025-03-16 15:13:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859020113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:15,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620471036] [2025-03-16 15:13:15,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:15,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:15,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:15,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:15,605 INFO L87 Difference]: Start difference. First operand 6912 states and 7180 transitions. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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 15:13:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:16,175 INFO L93 Difference]: Finished difference Result 14152 states and 14697 transitions. [2025-03-16 15:13:16,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:16,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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 1257 [2025-03-16 15:13:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:16,185 INFO L225 Difference]: With dead ends: 14152 [2025-03-16 15:13:16,185 INFO L226 Difference]: Without dead ends: 7899 [2025-03-16 15:13:16,190 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 15:13:16,190 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:16,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 438 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7899 states. [2025-03-16 15:13:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7899 to 7899. [2025-03-16 15:13:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7899 states, 7898 states have (on average 1.0349455558369207) internal successors, (8174), 7898 states have internal predecessors, (8174), 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 15:13:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7899 states to 7899 states and 8174 transitions. [2025-03-16 15:13:16,249 INFO L78 Accepts]: Start accepts. Automaton has 7899 states and 8174 transitions. Word has length 1257 [2025-03-16 15:13:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:16,250 INFO L471 AbstractCegarLoop]: Abstraction has 7899 states and 8174 transitions. [2025-03-16 15:13:16,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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 15:13:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7899 states and 8174 transitions. [2025-03-16 15:13:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1268 [2025-03-16 15:13:16,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:16,262 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-16 15:13:16,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:13:16,262 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:16,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1612398387, now seen corresponding path program 1 times [2025-03-16 15:13:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980580669] [2025-03-16 15:13:16,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:16,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1267 statements into 1 equivalence classes. [2025-03-16 15:13:16,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1267 of 1267 statements. [2025-03-16 15:13:16,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:16,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2621 backedges. 1952 proven. 202 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-03-16 15:13:17,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:17,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980580669] [2025-03-16 15:13:17,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980580669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:17,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933571024] [2025-03-16 15:13:17,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:17,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:17,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:17,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:17,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:13:17,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1267 statements into 1 equivalence classes. [2025-03-16 15:13:17,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1267 of 1267 statements. [2025-03-16 15:13:17,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:17,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:17,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:13:17,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2621 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 1737 trivial. 0 not checked. [2025-03-16 15:13:17,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:17,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933571024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:17,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:17,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:13:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521504992] [2025-03-16 15:13:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:17,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:17,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:17,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:17,531 INFO L87 Difference]: Start difference. First operand 7899 states and 8174 transitions. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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 15:13:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:18,118 INFO L93 Difference]: Finished difference Result 17442 states and 18074 transitions. [2025-03-16 15:13:18,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:18,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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 1267 [2025-03-16 15:13:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:18,129 INFO L225 Difference]: With dead ends: 17442 [2025-03-16 15:13:18,130 INFO L226 Difference]: Without dead ends: 8557 [2025-03-16 15:13:18,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1271 GetRequests, 1266 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:18,136 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 205 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:18,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 392 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8557 states. [2025-03-16 15:13:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8557 to 8557. [2025-03-16 15:13:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8557 states, 8556 states have (on average 1.0309724170172978) internal successors, (8821), 8556 states have internal predecessors, (8821), 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 15:13:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8557 states to 8557 states and 8821 transitions. [2025-03-16 15:13:18,196 INFO L78 Accepts]: Start accepts. Automaton has 8557 states and 8821 transitions. Word has length 1267 [2025-03-16 15:13:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 8557 states and 8821 transitions. [2025-03-16 15:13:18,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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 15:13:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8557 states and 8821 transitions. [2025-03-16 15:13:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1353 [2025-03-16 15:13:18,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:18,209 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:13:18,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:13:18,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 15:13:18,410 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:18,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1483963834, now seen corresponding path program 1 times [2025-03-16 15:13:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:18,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316245165] [2025-03-16 15:13:18,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:18,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:18,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1352 statements into 1 equivalence classes. [2025-03-16 15:13:18,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1352 of 1352 statements. [2025-03-16 15:13:18,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:18,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3762 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 3443 trivial. 0 not checked. [2025-03-16 15:13:19,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:19,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316245165] [2025-03-16 15:13:19,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316245165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:19,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:19,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:19,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149572844] [2025-03-16 15:13:19,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:19,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:19,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:19,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:19,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:19,034 INFO L87 Difference]: Start difference. First operand 8557 states and 8821 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 15:13:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:19,443 INFO L93 Difference]: Finished difference Result 8893 states and 9157 transitions. [2025-03-16 15:13:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 1352 [2025-03-16 15:13:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:19,454 INFO L225 Difference]: With dead ends: 8893 [2025-03-16 15:13:19,455 INFO L226 Difference]: Without dead ends: 8557 [2025-03-16 15:13:19,457 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 15:13:19,458 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:19,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:13:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8557 states. [2025-03-16 15:13:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8557 to 8557. [2025-03-16 15:13:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8557 states, 8556 states have (on average 1.0308555399719495) internal successors, (8820), 8556 states have internal predecessors, (8820), 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 15:13:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8557 states to 8557 states and 8820 transitions. [2025-03-16 15:13:19,547 INFO L78 Accepts]: Start accepts. Automaton has 8557 states and 8820 transitions. Word has length 1352 [2025-03-16 15:13:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:19,549 INFO L471 AbstractCegarLoop]: Abstraction has 8557 states and 8820 transitions. [2025-03-16 15:13:19,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 15:13:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8557 states and 8820 transitions. [2025-03-16 15:13:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1690 [2025-03-16 15:13:19,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:19,582 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2025-03-16 15:13:19,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:13:19,583 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:19,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1434958992, now seen corresponding path program 1 times [2025-03-16 15:13:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:19,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203770329] [2025-03-16 15:13:19,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:19,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1689 statements into 1 equivalence classes. [2025-03-16 15:13:19,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1689 of 1689 statements. [2025-03-16 15:13:19,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:19,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4980 backedges. 3336 proven. 202 refuted. 0 times theorem prover too weak. 1442 trivial. 0 not checked. [2025-03-16 15:13:20,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:20,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203770329] [2025-03-16 15:13:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203770329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:20,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327443871] [2025-03-16 15:13:20,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:20,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:20,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:20,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:20,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:13:20,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1689 statements into 1 equivalence classes. [2025-03-16 15:13:21,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1689 of 1689 statements. [2025-03-16 15:13:21,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:21,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:21,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1918 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:13:21,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4980 backedges. 2303 proven. 201 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2025-03-16 15:13:23,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:13:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4980 backedges. 2303 proven. 201 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2025-03-16 15:13:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327443871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:13:26,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:13:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-16 15:13:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506234186] [2025-03-16 15:13:26,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:13:26,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:13:26,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:26,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:13:26,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:13:26,220 INFO L87 Difference]: Start difference. First operand 8557 states and 8820 transitions. Second operand has 10 states, 10 states have (on average 174.3) internal successors, (1743), 9 states have internal predecessors, (1743), 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 15:13:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:29,537 INFO L93 Difference]: Finished difference Result 17442 states and 18015 transitions. [2025-03-16 15:13:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 15:13:29,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 174.3) internal successors, (1743), 9 states have internal predecessors, (1743), 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 1689 [2025-03-16 15:13:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:29,548 INFO L225 Difference]: With dead ends: 17442 [2025-03-16 15:13:29,548 INFO L226 Difference]: Without dead ends: 9544 [2025-03-16 15:13:29,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3387 GetRequests, 3373 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-16 15:13:29,556 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1499 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7469 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 7655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 7469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:29,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 91 Invalid, 7655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 7469 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 15:13:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2025-03-16 15:13:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 9215. [2025-03-16 15:13:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0253961363143043) internal successors, (9448), 9214 states have internal predecessors, (9448), 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 15:13:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9448 transitions. [2025-03-16 15:13:29,628 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9448 transitions. Word has length 1689 [2025-03-16 15:13:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:29,629 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9448 transitions. [2025-03-16 15:13:29,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 174.3) internal successors, (1743), 9 states have internal predecessors, (1743), 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 15:13:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9448 transitions. [2025-03-16 15:13:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1808 [2025-03-16 15:13:29,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:29,648 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-16 15:13:29,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:13:29,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:29,849 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:29,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1538044674, now seen corresponding path program 1 times [2025-03-16 15:13:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018434829] [2025-03-16 15:13:29,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:29,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1807 statements into 1 equivalence classes. [2025-03-16 15:13:29,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1807 of 1807 statements. [2025-03-16 15:13:29,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:29,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6042 backedges. 3779 proven. 1201 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-16 15:13:33,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:33,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018434829] [2025-03-16 15:13:33,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018434829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:33,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855733912] [2025-03-16 15:13:33,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:33,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:33,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:33,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:33,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:13:33,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1807 statements into 1 equivalence classes. [2025-03-16 15:13:33,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1807 of 1807 statements. [2025-03-16 15:13:33,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:33,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:33,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 2057 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:13:33,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6042 backedges. 4037 proven. 0 refuted. 0 times theorem prover too weak. 2005 trivial. 0 not checked. [2025-03-16 15:13:33,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:33,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855733912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:33,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:33,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-16 15:13:33,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982444170] [2025-03-16 15:13:33,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:33,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:33,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:33,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:33,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:13:33,744 INFO L87 Difference]: Start difference. First operand 9215 states and 9448 transitions. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 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 15:13:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:34,265 INFO L93 Difference]: Finished difference Result 19087 states and 19584 transitions. [2025-03-16 15:13:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:34,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 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 1807 [2025-03-16 15:13:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:34,276 INFO L225 Difference]: With dead ends: 19087 [2025-03-16 15:13:34,276 INFO L226 Difference]: Without dead ends: 10202 [2025-03-16 15:13:34,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1815 GetRequests, 1809 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:13:34,282 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 65 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:34,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 410 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2025-03-16 15:13:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 10202. [2025-03-16 15:13:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.0215665130869522) internal successors, (10421), 10201 states have internal predecessors, (10421), 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 15:13:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 10421 transitions. [2025-03-16 15:13:34,347 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 10421 transitions. Word has length 1807 [2025-03-16 15:13:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:34,348 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 10421 transitions. [2025-03-16 15:13:34,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 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 15:13:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 10421 transitions. [2025-03-16 15:13:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1928 [2025-03-16 15:13:34,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:34,371 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:13:34,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:13:34,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 15:13:34,571 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:34,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash 577745030, now seen corresponding path program 1 times [2025-03-16 15:13:34,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:34,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989512952] [2025-03-16 15:13:34,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:34,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1927 statements into 1 equivalence classes. [2025-03-16 15:13:34,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1927 of 1927 statements. [2025-03-16 15:13:34,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:34,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8171 backedges. 4447 proven. 567 refuted. 0 times theorem prover too weak. 3157 trivial. 0 not checked. [2025-03-16 15:13:36,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:36,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989512952] [2025-03-16 15:13:36,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989512952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:36,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916391522] [2025-03-16 15:13:36,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:36,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:36,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:36,557 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:36,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:13:36,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1927 statements into 1 equivalence classes. [2025-03-16 15:13:36,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1927 of 1927 statements. [2025-03-16 15:13:36,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:36,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:36,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 2230 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:13:36,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8171 backedges. 4545 proven. 0 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2025-03-16 15:13:37,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:37,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916391522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:37,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:37,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:13:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455597491] [2025-03-16 15:13:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:37,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:37,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:37,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:37,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:37,034 INFO L87 Difference]: Start difference. First operand 10202 states and 10421 transitions. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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 15:13:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:37,609 INFO L93 Difference]: Finished difference Result 19745 states and 20179 transitions. [2025-03-16 15:13:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:37,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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 1927 [2025-03-16 15:13:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:37,620 INFO L225 Difference]: With dead ends: 19745 [2025-03-16 15:13:37,621 INFO L226 Difference]: Without dead ends: 10202 [2025-03-16 15:13:37,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1932 GetRequests, 1928 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:37,626 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 208 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:37,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 386 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2025-03-16 15:13:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 10202. [2025-03-16 15:13:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.017547299284384) internal successors, (10380), 10201 states have internal predecessors, (10380), 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 15:13:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 10380 transitions. [2025-03-16 15:13:37,685 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 10380 transitions. Word has length 1927 [2025-03-16 15:13:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:37,686 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 10380 transitions. [2025-03-16 15:13:37,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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 15:13:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 10380 transitions. [2025-03-16 15:13:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1959 [2025-03-16 15:13:37,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:37,705 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-16 15:13:37,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:13:37,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:37,906 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:37,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1357581920, now seen corresponding path program 1 times [2025-03-16 15:13:37,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:37,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993322112] [2025-03-16 15:13:37,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:37,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:37,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1958 statements into 1 equivalence classes. [2025-03-16 15:13:38,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1958 of 1958 statements. [2025-03-16 15:13:38,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:38,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8225 backedges. 6295 proven. 161 refuted. 0 times theorem prover too weak. 1769 trivial. 0 not checked. [2025-03-16 15:13:40,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:40,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993322112] [2025-03-16 15:13:40,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993322112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:40,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727133531] [2025-03-16 15:13:40,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:40,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:40,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:40,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:40,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:13:40,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1958 statements into 1 equivalence classes. [2025-03-16 15:13:40,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1958 of 1958 statements. [2025-03-16 15:13:40,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:40,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:40,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 2262 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:13:40,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8225 backedges. 4979 proven. 0 refuted. 0 times theorem prover too weak. 3246 trivial. 0 not checked. [2025-03-16 15:13:41,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727133531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:41,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-16 15:13:41,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393222555] [2025-03-16 15:13:41,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:41,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:41,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:41,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:41,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:13:41,225 INFO L87 Difference]: Start difference. First operand 10202 states and 10380 transitions. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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 15:13:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:41,756 INFO L93 Difference]: Finished difference Result 19745 states and 20097 transitions. [2025-03-16 15:13:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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 1958 [2025-03-16 15:13:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:41,764 INFO L225 Difference]: With dead ends: 19745 [2025-03-16 15:13:41,765 INFO L226 Difference]: Without dead ends: 10202 [2025-03-16 15:13:41,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1967 GetRequests, 1961 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:13:41,769 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:41,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 423 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2025-03-16 15:13:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 10202. [2025-03-16 15:13:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.017155180864621) internal successors, (10376), 10201 states have internal predecessors, (10376), 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 15:13:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 10376 transitions. [2025-03-16 15:13:41,836 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 10376 transitions. Word has length 1958 [2025-03-16 15:13:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:41,837 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 10376 transitions. [2025-03-16 15:13:41,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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 15:13:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 10376 transitions. [2025-03-16 15:13:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1980 [2025-03-16 15:13:41,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:41,855 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 15:13:41,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:13:42,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:42,056 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:42,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash -254392359, now seen corresponding path program 1 times [2025-03-16 15:13:42,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:42,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673529463] [2025-03-16 15:13:42,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:42,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:42,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1979 statements into 1 equivalence classes. [2025-03-16 15:13:42,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1979 of 1979 statements. [2025-03-16 15:13:42,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:42,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7935 backedges. 3752 proven. 252 refuted. 0 times theorem prover too weak. 3931 trivial. 0 not checked. [2025-03-16 15:13:45,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:45,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673529463] [2025-03-16 15:13:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673529463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931239175] [2025-03-16 15:13:45,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:45,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:45,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:45,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:45,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:13:45,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1979 statements into 1 equivalence classes. [2025-03-16 15:13:45,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1979 of 1979 statements. [2025-03-16 15:13:45,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:45,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:45,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 2277 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:13:45,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7935 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 7496 trivial. 0 not checked. [2025-03-16 15:13:46,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931239175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:46,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:46,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-16 15:13:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942989032] [2025-03-16 15:13:46,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:46,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:46,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:46,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:13:46,091 INFO L87 Difference]: Start difference. First operand 10202 states and 10376 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 15:13:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:46,896 INFO L93 Difference]: Finished difference Result 20401 states and 20755 transitions. [2025-03-16 15:13:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:46,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 1979 [2025-03-16 15:13:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:46,898 INFO L225 Difference]: With dead ends: 20401 [2025-03-16 15:13:46,898 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:13:46,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1987 GetRequests, 1981 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:13:46,906 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 291 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:46,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 427 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:13:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:13:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:13:46,906 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 15:13:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:13:46,907 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1979 [2025-03-16 15:13:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:46,907 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:13:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 15:13:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:13:46,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:13:46,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:13:46,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 15:13:47,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:47,115 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:47,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:13:47,499 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:13:47,515 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 15:13:47,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:13:47 BoogieIcfgContainer [2025-03-16 15:13:47,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:13:47,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:13:47,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:13:47,521 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:13:47,521 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:12:55" (3/4) ... [2025-03-16 15:13:47,524 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:13:47,549 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:13:47,550 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:13:47,552 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:13:47,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:13:47,699 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:13:47,699 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:13:47,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:13:47,700 INFO L158 Benchmark]: Toolchain (without parser) took 54668.08ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 128.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 880.5MB. Max. memory is 16.1GB. [2025-03-16 15:13:47,700 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:13:47,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.97ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 70.3MB in the end (delta: 57.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-16 15:13:47,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.19ms. Allocated memory is still 167.8MB. Free memory was 70.3MB in the beginning and 47.1MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:13:47,701 INFO L158 Benchmark]: Boogie Preprocessor took 187.22ms. Allocated memory is still 167.8MB. Free memory was 47.1MB in the beginning and 88.2MB in the end (delta: -41.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-03-16 15:13:47,701 INFO L158 Benchmark]: IcfgBuilder took 1635.67ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 110.0MB in the end (delta: -21.7MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2025-03-16 15:13:47,701 INFO L158 Benchmark]: TraceAbstraction took 51936.18ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 110.0MB in the beginning and 491.6MB in the end (delta: -381.6MB). Peak memory consumption was 837.2MB. Max. memory is 16.1GB. [2025-03-16 15:13:47,701 INFO L158 Benchmark]: Witness Printer took 178.65ms. Allocated memory was 1.4GB in the beginning and 1.8GB in the end (delta: 436.2MB). Free memory was 491.6MB in the beginning and 1.7GB in the end (delta: -1.2GB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2025-03-16 15:13:47,702 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 610.97ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 70.3MB in the end (delta: 57.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.19ms. Allocated memory is still 167.8MB. Free memory was 70.3MB in the beginning and 47.1MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 187.22ms. Allocated memory is still 167.8MB. Free memory was 47.1MB in the beginning and 88.2MB in the end (delta: -41.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1635.67ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 110.0MB in the end (delta: -21.7MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * TraceAbstraction took 51936.18ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 110.0MB in the beginning and 491.6MB in the end (delta: -381.6MB). Peak memory consumption was 837.2MB. Max. memory is 16.1GB. * Witness Printer took 178.65ms. Allocated memory was 1.4GB in the beginning and 1.8GB in the end (delta: 436.2MB). Free memory was 491.6MB in the beginning and 1.7GB in the end (delta: -1.2GB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 143]: 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, 335 locations, 661 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.5s, OverallIterations: 21, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6366 SdHoareTripleChecker+Valid, 17.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6366 mSDsluCounter, 7360 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 428 mSDsCounter, 2369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25469 IncrementalHoareTripleChecker+Invalid, 27838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2369 mSolverCounterUnsat, 6932 mSDtfsCounter, 25469 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13303 GetRequests, 13234 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10202occurred in iteration=18, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 666 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 32176 NumberOfCodeBlocks, 32176 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 33836 ConstructedInterpolants, 40 QuantifiedInterpolants, 95961 SizeOfPredicates, 3 NumberOfNonLiveVariables, 13254 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 97653/101279 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: 1783]: Location Invariant Derived location invariant: (((((((((((((a16 <= 8) && (7 <= a12)) && (4 <= a15)) || ((((a12 == 9) && (a16 == 8)) && (135 <= a18)) && (a15 == 3))) || ((((a12 <= 5) && (a16 <= 11)) && (4 <= a15)) && (a16 != 8))) || (((a16 <= 11) && (a15 == 3)) && (a16 != 8))) || ((a16 <= 8) && (a12 == 8))) || (((a12 == 6) && (a16 <= 11)) && (4 <= a15))) || ((a16 <= 8) && (a15 == 3))) || (((a16 <= 8) && (a15 <= 3)) && (a12 <= 7))) || (((a16 == 12) && ((5 != a12) || (0 < ((long long) a18 + 156)))) && (a15 == 3))) || (((a16 == 8) && (a15 == 4)) && (5 == a12))) || ((a16 <= 9) && (a16 != 8))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:13:47,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE