./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label56.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/Problem03_label56.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 bac94640e4b1ca65f803532eef7d71e2867b8956b5651dd4d9133fab907f3070 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:12:14,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:12:14,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:12:14,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:12:14,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:12:15,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:12:15,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:12:15,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:12:15,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:12:15,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:12:15,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:12:15,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:12:15,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:12:15,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:12:15,005 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:12:15,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:12:15,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:12:15,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:12:15,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:12:15,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:12:15,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:12:15,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:12:15,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:12:15,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:12:15,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:12:15,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:12:15,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:12:15,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:12:15,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:12:15,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:12:15,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:12:15,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:12:15,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:12:15,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:12:15,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:12:15,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:12:15,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:12:15,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:12:15,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:12:15,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:12:15,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:12:15,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:12:15,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:12:15,008 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 -> bac94640e4b1ca65f803532eef7d71e2867b8956b5651dd4d9133fab907f3070 [2025-03-16 14:12:15,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:12:15,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:12:15,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:12:15,230 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:12:15,230 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:12:15,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label56.c [2025-03-16 14:12:16,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0523ef7e2/fc938e442016458096c60160c7a2f851/FLAG8f8c73dd3 [2025-03-16 14:12:16,727 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:12:16,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label56.c [2025-03-16 14:12:16,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0523ef7e2/fc938e442016458096c60160c7a2f851/FLAG8f8c73dd3 [2025-03-16 14:12:16,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0523ef7e2/fc938e442016458096c60160c7a2f851 [2025-03-16 14:12:16,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:12:16,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:12:16,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:12:16,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:12:16,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:12:16,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:12:16" (1/1) ... [2025-03-16 14:12:16,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34dc6e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:16, skipping insertion in model container [2025-03-16 14:12:16,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:12:16" (1/1) ... [2025-03-16 14:12:16,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:12:17,357 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/Problem03_label56.c[57575,57588] [2025-03-16 14:12:17,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:12:17,402 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:12:17,529 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/Problem03_label56.c[57575,57588] [2025-03-16 14:12:17,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:12:17,559 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:12:17,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17 WrapperNode [2025-03-16 14:12:17,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:12:17,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:12:17,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:12:17,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:12:17,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,672 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:12:17,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:12:17,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:12:17,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:12:17,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:12:17,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,733 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:12:17,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:12:17,808 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:12:17,808 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:12:17,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:12:17,810 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (1/1) ... [2025-03-16 14:12:17,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:12:17,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:17,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:12:17,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:12:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:12:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:12:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:12:17,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:12:17,929 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:12:17,931 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:12:19,270 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:12:19,270 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:12:19,285 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:12:19,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:12:19,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:19 BoogieIcfgContainer [2025-03-16 14:12:19,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:12:19,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:12:19,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:12:19,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:12:19,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:12:16" (1/3) ... [2025-03-16 14:12:19,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e9bef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:12:19, skipping insertion in model container [2025-03-16 14:12:19,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:17" (2/3) ... [2025-03-16 14:12:19,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e9bef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:12:19, skipping insertion in model container [2025-03-16 14:12:19,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:19" (3/3) ... [2025-03-16 14:12:19,295 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label56.c [2025-03-16 14:12:19,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:12:19,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label56.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:12:19,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:12:19,374 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;@1bb33ab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:12:19,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:12:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-16 14:12:19,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:19,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:19,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:19,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1435559238, now seen corresponding path program 1 times [2025-03-16 14:12:19,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:19,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907194088] [2025-03-16 14:12:19,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:19,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-16 14:12:19,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-16 14:12:19,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:19,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907194088] [2025-03-16 14:12:19,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907194088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:19,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288690036] [2025-03-16 14:12:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:19,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:12:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:19,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:12:19,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:12:19,957 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 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 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:19,995 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:12:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:12:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2025-03-16 14:12:19,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:20,005 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:12:20,006 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:12:20,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:12:20,013 INFO L435 NwaCegarLoop]: 395 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, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:20,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:12:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:12:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:12:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:12:20,060 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 172 [2025-03-16 14:12:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:20,061 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:12:20,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:12:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-16 14:12:20,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:20,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:20,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:12:20,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:20,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash 215424187, now seen corresponding path program 1 times [2025-03-16 14:12:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:20,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812082530] [2025-03-16 14:12:20,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:20,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:20,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-16 14:12:20,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-16 14:12:20,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:20,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:20,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:20,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812082530] [2025-03-16 14:12:20,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812082530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:20,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:20,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778825159] [2025-03-16 14:12:20,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:20,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:20,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:20,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:20,567 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:21,315 INFO L93 Difference]: Finished difference Result 701 states and 1160 transitions. [2025-03-16 14:12:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:21,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2025-03-16 14:12:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:21,318 INFO L225 Difference]: With dead ends: 701 [2025-03-16 14:12:21,318 INFO L226 Difference]: Without dead ends: 464 [2025-03-16 14:12:21,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:21,320 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 99 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:21,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 132 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:12:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-16 14:12:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458. [2025-03-16 14:12:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5579868708971554) internal successors, (712), 457 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 712 transitions. [2025-03-16 14:12:21,343 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 712 transitions. Word has length 172 [2025-03-16 14:12:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:21,343 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 712 transitions. [2025-03-16 14:12:21,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 712 transitions. [2025-03-16 14:12:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 14:12:21,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:21,346 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:21,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:12:21,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:21,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1459405161, now seen corresponding path program 1 times [2025-03-16 14:12:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342879018] [2025-03-16 14:12:21,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:21,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 14:12:21,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 14:12:21,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:21,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342879018] [2025-03-16 14:12:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342879018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148094276] [2025-03-16 14:12:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:21,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:21,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:21,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:21,573 INFO L87 Difference]: Start difference. First operand 458 states and 712 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:22,262 INFO L93 Difference]: Finished difference Result 1342 states and 2101 transitions. [2025-03-16 14:12:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:22,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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 180 [2025-03-16 14:12:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:22,266 INFO L225 Difference]: With dead ends: 1342 [2025-03-16 14:12:22,266 INFO L226 Difference]: Without dead ends: 885 [2025-03-16 14:12:22,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:22,268 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:22,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 89 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:12:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-16 14:12:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 867. [2025-03-16 14:12:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.5346420323325636) internal successors, (1329), 866 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1329 transitions. [2025-03-16 14:12:22,297 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1329 transitions. Word has length 180 [2025-03-16 14:12:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:22,297 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1329 transitions. [2025-03-16 14:12:22,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1329 transitions. [2025-03-16 14:12:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 14:12:22,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:22,301 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:12:22,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:22,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:22,302 INFO L85 PathProgramCache]: Analyzing trace with hash 158812803, now seen corresponding path program 1 times [2025-03-16 14:12:22,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105632467] [2025-03-16 14:12:22,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:22,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:22,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 14:12:22,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 14:12:22,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:22,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:22,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:22,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105632467] [2025-03-16 14:12:22,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105632467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:22,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:22,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024750176] [2025-03-16 14:12:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:22,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:22,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:22,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:22,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:22,571 INFO L87 Difference]: Start difference. First operand 867 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:23,199 INFO L93 Difference]: Finished difference Result 2545 states and 3910 transitions. [2025-03-16 14:12:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:23,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 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 181 [2025-03-16 14:12:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:23,204 INFO L225 Difference]: With dead ends: 2545 [2025-03-16 14:12:23,204 INFO L226 Difference]: Without dead ends: 1679 [2025-03-16 14:12:23,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:23,209 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 213 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:23,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 191 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2025-03-16 14:12:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2025-03-16 14:12:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1678 states have (on average 1.3444576877234804) internal successors, (2256), 1678 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2256 transitions. [2025-03-16 14:12:23,262 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2256 transitions. Word has length 181 [2025-03-16 14:12:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:23,262 INFO L471 AbstractCegarLoop]: Abstraction has 1679 states and 2256 transitions. [2025-03-16 14:12:23,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2256 transitions. [2025-03-16 14:12:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 14:12:23,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:23,266 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:23,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:12:23,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:23,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 125494323, now seen corresponding path program 1 times [2025-03-16 14:12:23,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:23,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658245204] [2025-03-16 14:12:23,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:23,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 14:12:23,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 14:12:23,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:23,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:23,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:23,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658245204] [2025-03-16 14:12:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658245204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:23,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:23,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725040021] [2025-03-16 14:12:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:23,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:23,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:23,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:23,548 INFO L87 Difference]: Start difference. First operand 1679 states and 2256 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:24,338 INFO L93 Difference]: Finished difference Result 5009 states and 6730 transitions. [2025-03-16 14:12:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:24,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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 184 [2025-03-16 14:12:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:24,351 INFO L225 Difference]: With dead ends: 5009 [2025-03-16 14:12:24,352 INFO L226 Difference]: Without dead ends: 3331 [2025-03-16 14:12:24,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:24,357 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:24,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 97 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:12:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2025-03-16 14:12:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3328. [2025-03-16 14:12:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3328 states, 3327 states have (on average 1.321009918845807) internal successors, (4395), 3327 states have internal predecessors, (4395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 4395 transitions. [2025-03-16 14:12:24,428 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 4395 transitions. Word has length 184 [2025-03-16 14:12:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:24,429 INFO L471 AbstractCegarLoop]: Abstraction has 3328 states and 4395 transitions. [2025-03-16 14:12:24,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 4395 transitions. [2025-03-16 14:12:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 14:12:24,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:24,434 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:24,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:12:24,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:24,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash -895720788, now seen corresponding path program 1 times [2025-03-16 14:12:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:24,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469862302] [2025-03-16 14:12:24,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:24,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 14:12:24,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:12:24,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:24,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:24,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:24,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469862302] [2025-03-16 14:12:24,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469862302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:24,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966989690] [2025-03-16 14:12:24,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:24,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:24,725 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 14:12:24,726 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 14:12:24,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 14:12:24,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:12:24,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:24,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:24,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:24,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:12:25,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:25,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966989690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:25,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:25,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:12:25,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962808972] [2025-03-16 14:12:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:25,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:25,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:25,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:25,056 INFO L87 Difference]: Start difference. First operand 3328 states and 4395 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:25,809 INFO L93 Difference]: Finished difference Result 8286 states and 11244 transitions. [2025-03-16 14:12:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:25,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 187 [2025-03-16 14:12:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:25,827 INFO L225 Difference]: With dead ends: 8286 [2025-03-16 14:12:25,827 INFO L226 Difference]: Without dead ends: 4959 [2025-03-16 14:12:25,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:25,832 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 68 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:25,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 399 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:12:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2025-03-16 14:12:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2025-03-16 14:12:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4955 states, 4954 states have (on average 1.259184497375858) internal successors, (6238), 4954 states have internal predecessors, (6238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 6238 transitions. [2025-03-16 14:12:25,935 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 6238 transitions. Word has length 187 [2025-03-16 14:12:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:25,936 INFO L471 AbstractCegarLoop]: Abstraction has 4955 states and 6238 transitions. [2025-03-16 14:12:25,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 6238 transitions. [2025-03-16 14:12:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-16 14:12:25,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:25,941 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:25,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:12:26,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 14:12:26,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:26,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -94137945, now seen corresponding path program 1 times [2025-03-16 14:12:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159576274] [2025-03-16 14:12:26,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:26,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-16 14:12:26,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-16 14:12:26,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:26,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:12:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159576274] [2025-03-16 14:12:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159576274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:26,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:26,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349549436] [2025-03-16 14:12:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:26,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:12:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:26,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:12:26,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:26,343 INFO L87 Difference]: Start difference. First operand 4955 states and 6238 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:27,020 INFO L93 Difference]: Finished difference Result 9894 states and 12460 transitions. [2025-03-16 14:12:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:12:27,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 3 states have internal predecessors, (223), 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 228 [2025-03-16 14:12:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:27,034 INFO L225 Difference]: With dead ends: 9894 [2025-03-16 14:12:27,034 INFO L226 Difference]: Without dead ends: 4940 [2025-03-16 14:12:27,040 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 14:12:27,040 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 798 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:27,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 42 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2025-03-16 14:12:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4928. [2025-03-16 14:12:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4928 states, 4927 states have (on average 1.2269129287598945) internal successors, (6045), 4927 states have internal predecessors, (6045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4928 states to 4928 states and 6045 transitions. [2025-03-16 14:12:27,112 INFO L78 Accepts]: Start accepts. Automaton has 4928 states and 6045 transitions. Word has length 228 [2025-03-16 14:12:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:27,112 INFO L471 AbstractCegarLoop]: Abstraction has 4928 states and 6045 transitions. [2025-03-16 14:12:27,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4928 states and 6045 transitions. [2025-03-16 14:12:27,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-16 14:12:27,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:27,117 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:27,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:12:27,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:27,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1886931500, now seen corresponding path program 1 times [2025-03-16 14:12:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:27,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193315625] [2025-03-16 14:12:27,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:27,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-16 14:12:27,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-16 14:12:27,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:27,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:27,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:27,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193315625] [2025-03-16 14:12:27,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193315625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:27,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:27,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:27,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208581243] [2025-03-16 14:12:27,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:27,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:27,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:27,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:27,493 INFO L87 Difference]: Start difference. First operand 4928 states and 6045 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:28,053 INFO L93 Difference]: Finished difference Result 11497 states and 13971 transitions. [2025-03-16 14:12:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:28,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 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 235 [2025-03-16 14:12:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:28,071 INFO L225 Difference]: With dead ends: 11497 [2025-03-16 14:12:28,071 INFO L226 Difference]: Without dead ends: 6570 [2025-03-16 14:12:28,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:28,078 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:28,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 113 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6570 states. [2025-03-16 14:12:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6570 to 6566. [2025-03-16 14:12:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 6565 states have (on average 1.202894135567403) internal successors, (7897), 6565 states have internal predecessors, (7897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 7897 transitions. [2025-03-16 14:12:28,178 INFO L78 Accepts]: Start accepts. Automaton has 6566 states and 7897 transitions. Word has length 235 [2025-03-16 14:12:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:28,178 INFO L471 AbstractCegarLoop]: Abstraction has 6566 states and 7897 transitions. [2025-03-16 14:12:28,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 6566 states and 7897 transitions. [2025-03-16 14:12:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-16 14:12:28,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:28,214 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:28,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:12:28,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:28,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1335974607, now seen corresponding path program 1 times [2025-03-16 14:12:28,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:28,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658262984] [2025-03-16 14:12:28,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:28,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:28,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 14:12:28,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 14:12:28,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:28,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:28,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658262984] [2025-03-16 14:12:28,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658262984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:28,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278749897] [2025-03-16 14:12:28,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:28,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:28,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:28,589 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 14:12:28,591 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 14:12:28,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 14:12:28,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 14:12:28,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:28,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:28,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:28,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:28,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:28,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278749897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899279077] [2025-03-16 14:12:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:28,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:28,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:28,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:28,912 INFO L87 Difference]: Start difference. First operand 6566 states and 7897 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:29,546 INFO L93 Difference]: Finished difference Result 18413 states and 22160 transitions. [2025-03-16 14:12:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:29,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 242 [2025-03-16 14:12:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:29,574 INFO L225 Difference]: With dead ends: 18413 [2025-03-16 14:12:29,575 INFO L226 Difference]: Without dead ends: 11848 [2025-03-16 14:12:29,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:29,584 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 153 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:29,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 147 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2025-03-16 14:12:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11846. [2025-03-16 14:12:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11846 states, 11845 states have (on average 1.1653018151118615) internal successors, (13803), 11845 states have internal predecessors, (13803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11846 states to 11846 states and 13803 transitions. [2025-03-16 14:12:29,746 INFO L78 Accepts]: Start accepts. Automaton has 11846 states and 13803 transitions. Word has length 242 [2025-03-16 14:12:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:29,747 INFO L471 AbstractCegarLoop]: Abstraction has 11846 states and 13803 transitions. [2025-03-16 14:12:29,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11846 states and 13803 transitions. [2025-03-16 14:12:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-16 14:12:29,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:29,755 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:29,761 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 14:12:29,955 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,SelfDestructingSolverStorable8 [2025-03-16 14:12:29,956 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:29,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1861237094, now seen corresponding path program 1 times [2025-03-16 14:12:29,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:29,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173624148] [2025-03-16 14:12:29,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:29,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:29,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-16 14:12:29,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-16 14:12:29,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:29,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-16 14:12:30,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173624148] [2025-03-16 14:12:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173624148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:30,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176366620] [2025-03-16 14:12:30,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:30,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:30,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:30,744 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 14:12:30,746 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 14:12:30,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-16 14:12:30,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-16 14:12:30,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:30,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:30,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:30,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 14:12:31,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:31,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176366620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:31,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:31,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:12:31,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312382130] [2025-03-16 14:12:31,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:31,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:31,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:31,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:31,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:31,033 INFO L87 Difference]: Start difference. First operand 11846 states and 13803 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:31,662 INFO L93 Difference]: Finished difference Result 23703 states and 27627 transitions. [2025-03-16 14:12:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:31,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 251 [2025-03-16 14:12:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:31,681 INFO L225 Difference]: With dead ends: 23703 [2025-03-16 14:12:31,682 INFO L226 Difference]: Without dead ends: 11858 [2025-03-16 14:12:31,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:31,693 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 52 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:31,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 357 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2025-03-16 14:12:31,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 11846. [2025-03-16 14:12:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11846 states, 11845 states have (on average 1.151962853524694) internal successors, (13645), 11845 states have internal predecessors, (13645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11846 states to 11846 states and 13645 transitions. [2025-03-16 14:12:31,844 INFO L78 Accepts]: Start accepts. Automaton has 11846 states and 13645 transitions. Word has length 251 [2025-03-16 14:12:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:31,844 INFO L471 AbstractCegarLoop]: Abstraction has 11846 states and 13645 transitions. [2025-03-16 14:12:31,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 11846 states and 13645 transitions. [2025-03-16 14:12:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 14:12:31,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:31,854 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:31,860 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 14:12:32,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:32,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:32,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1571297847, now seen corresponding path program 1 times [2025-03-16 14:12:32,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:32,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349034281] [2025-03-16 14:12:32,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:32,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:32,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 14:12:32,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 14:12:32,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:32,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349034281] [2025-03-16 14:12:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349034281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585966659] [2025-03-16 14:12:33,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:33,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:33,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:33,098 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 14:12:33,100 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 14:12:33,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 14:12:33,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 14:12:33,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:33,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:33,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:33,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:33,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585966659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:33,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 14:12:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772187492] [2025-03-16 14:12:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:33,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:33,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:33,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:33,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:33,370 INFO L87 Difference]: Start difference. First operand 11846 states and 13645 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:33,884 INFO L93 Difference]: Finished difference Result 23697 states and 27299 transitions. [2025-03-16 14:12:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:33,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 268 [2025-03-16 14:12:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:33,901 INFO L225 Difference]: With dead ends: 23697 [2025-03-16 14:12:33,901 INFO L226 Difference]: Without dead ends: 11852 [2025-03-16 14:12:33,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 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 14:12:33,911 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 92 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:33,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 289 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2025-03-16 14:12:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 11846. [2025-03-16 14:12:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11846 states, 11845 states have (on average 1.1371886872097932) internal successors, (13470), 11845 states have internal predecessors, (13470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11846 states to 11846 states and 13470 transitions. [2025-03-16 14:12:34,026 INFO L78 Accepts]: Start accepts. Automaton has 11846 states and 13470 transitions. Word has length 268 [2025-03-16 14:12:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:34,027 INFO L471 AbstractCegarLoop]: Abstraction has 11846 states and 13470 transitions. [2025-03-16 14:12:34,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 11846 states and 13470 transitions. [2025-03-16 14:12:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-16 14:12:34,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:34,036 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:34,043 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 14:12:34,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:34,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:34,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1904981460, now seen corresponding path program 1 times [2025-03-16 14:12:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:34,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914984811] [2025-03-16 14:12:34,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:34,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-16 14:12:34,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-16 14:12:34,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:34,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-16 14:12:35,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914984811] [2025-03-16 14:12:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914984811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595282901] [2025-03-16 14:12:35,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:35,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:35,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:35,043 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 14:12:35,046 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 14:12:35,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-16 14:12:35,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-16 14:12:35,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:35,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:35,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:35,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 14:12:35,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:35,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595282901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:35,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:35,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:12:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656012226] [2025-03-16 14:12:35,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:35,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:35,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:35,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:35,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:35,228 INFO L87 Difference]: Start difference. First operand 11846 states and 13470 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:35,760 INFO L93 Difference]: Finished difference Result 23484 states and 26716 transitions. [2025-03-16 14:12:35,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:35,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 285 [2025-03-16 14:12:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:35,774 INFO L225 Difference]: With dead ends: 23484 [2025-03-16 14:12:35,775 INFO L226 Difference]: Without dead ends: 11639 [2025-03-16 14:12:35,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:35,786 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 218 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:35,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 334 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11639 states. [2025-03-16 14:12:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11639 to 11633. [2025-03-16 14:12:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11633 states, 11632 states have (on average 1.1196698762035764) internal successors, (13024), 11632 states have internal predecessors, (13024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 13024 transitions. [2025-03-16 14:12:35,909 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 13024 transitions. Word has length 285 [2025-03-16 14:12:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:35,909 INFO L471 AbstractCegarLoop]: Abstraction has 11633 states and 13024 transitions. [2025-03-16 14:12:35,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 13024 transitions. [2025-03-16 14:12:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-16 14:12:35,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:35,920 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:12:35,928 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 14:12:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 14:12:36,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:36,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash -163827949, now seen corresponding path program 1 times [2025-03-16 14:12:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822358837] [2025-03-16 14:12:36,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:36,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-16 14:12:36,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-16 14:12:36,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:36,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 136 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822358837] [2025-03-16 14:12:36,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822358837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952651824] [2025-03-16 14:12:36,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:36,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:36,383 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 14:12:36,384 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 14:12:36,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-16 14:12:36,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-16 14:12:36,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:36,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:36,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:36,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:36,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952651824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:36,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:36,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381424897] [2025-03-16 14:12:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:36,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:36,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:36,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:36,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:36,616 INFO L87 Difference]: Start difference. First operand 11633 states and 13024 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:36,881 INFO L93 Difference]: Finished difference Result 34055 states and 38175 transitions. [2025-03-16 14:12:36,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:36,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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 309 [2025-03-16 14:12:36,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:36,908 INFO L225 Difference]: With dead ends: 34055 [2025-03-16 14:12:36,908 INFO L226 Difference]: Without dead ends: 22423 [2025-03-16 14:12:36,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:36,921 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 233 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:36,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 821 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:12:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22423 states. [2025-03-16 14:12:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22423 to 22015. [2025-03-16 14:12:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22015 states, 22014 states have (on average 1.1094757881348234) internal successors, (24424), 22014 states have internal predecessors, (24424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 24424 transitions. [2025-03-16 14:12:37,161 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 24424 transitions. Word has length 309 [2025-03-16 14:12:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:37,161 INFO L471 AbstractCegarLoop]: Abstraction has 22015 states and 24424 transitions. [2025-03-16 14:12:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 24424 transitions. [2025-03-16 14:12:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-16 14:12:37,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:37,173 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:37,180 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 14:12:37,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:37,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:37,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2040509419, now seen corresponding path program 1 times [2025-03-16 14:12:37,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:37,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583467284] [2025-03-16 14:12:37,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:37,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-16 14:12:37,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-16 14:12:37,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:37,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-16 14:12:38,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:38,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583467284] [2025-03-16 14:12:38,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583467284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:38,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150241970] [2025-03-16 14:12:38,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:38,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:38,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:38,178 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 14:12:38,179 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 14:12:38,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-16 14:12:38,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-16 14:12:38,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:38,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:38,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:38,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-16 14:12:38,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150241970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:38,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:12:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058620525] [2025-03-16 14:12:38,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:38,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:38,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:38,446 INFO L87 Difference]: Start difference. First operand 22015 states and 24424 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:38,976 INFO L93 Difference]: Finished difference Result 57672 states and 64256 transitions. [2025-03-16 14:12:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:38,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 314 [2025-03-16 14:12:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:38,978 INFO L225 Difference]: With dead ends: 57672 [2025-03-16 14:12:38,978 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:12:39,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:39,003 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 56 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:39,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 343 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:12:39,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:12:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:12:39,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 314 [2025-03-16 14:12:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:39,005 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:12:39,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:12:39,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:12:39,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:12:39,016 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 14:12:39,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:39,213 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:39,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:12:40,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:12:40,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:12:40 BoogieIcfgContainer [2025-03-16 14:12:40,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:12:40,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:12:40,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:12:40,713 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:12:40,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:19" (3/4) ... [2025-03-16 14:12:40,715 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:12:40,734 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:12:40,736 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:12:40,737 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:12:40,739 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:12:40,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:12:40,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:12:40,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:12:40,861 INFO L158 Benchmark]: Toolchain (without parser) took 23953.76ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 100.5MB in the beginning and 719.1MB in the end (delta: -618.6MB). Peak memory consumption was 238.1MB. Max. memory is 16.1GB. [2025-03-16 14:12:40,861 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:12:40,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.93ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 41.9MB in the end (delta: 58.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-16 14:12:40,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.75ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 91.8MB in the end (delta: -50.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-16 14:12:40,861 INFO L158 Benchmark]: Boogie Preprocessor took 133.09ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 80.7MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:12:40,861 INFO L158 Benchmark]: IcfgBuilder took 1477.77ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 80.7MB in the beginning and 207.6MB in the end (delta: -126.9MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-03-16 14:12:40,862 INFO L158 Benchmark]: TraceAbstraction took 21424.53ms. Allocated memory was 318.8MB in the beginning and 1.0GB in the end (delta: 687.9MB). Free memory was 206.6MB in the beginning and 744.2MB in the end (delta: -537.6MB). Peak memory consumption was 578.7MB. Max. memory is 16.1GB. [2025-03-16 14:12:40,862 INFO L158 Benchmark]: Witness Printer took 147.21ms. Allocated memory is still 1.0GB. Free memory was 744.2MB in the beginning and 719.1MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:12:40,863 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.93ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 41.9MB in the end (delta: 58.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.75ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 91.8MB in the end (delta: -50.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.09ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 80.7MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1477.77ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 80.7MB in the beginning and 207.6MB in the end (delta: -126.9MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21424.53ms. Allocated memory was 318.8MB in the beginning and 1.0GB in the end (delta: 687.9MB). Free memory was 206.6MB in the beginning and 744.2MB in the end (delta: -537.6MB). Peak memory consumption was 578.7MB. Max. memory is 16.1GB. * Witness Printer took 147.21ms. Allocated memory is still 1.0GB. Free memory was 744.2MB in the beginning and 719.1MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: 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, 241 locations, 457 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2676 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2676 mSDsluCounter, 3749 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 473 mSDsCounter, 1334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7276 IncrementalHoareTripleChecker+Invalid, 8610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1334 mSolverCounterUnsat, 3276 mSDtfsCounter, 7276 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1891 GetRequests, 1859 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22015occurred in iteration=13, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 481 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 5064 NumberOfCodeBlocks, 5064 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5043 ConstructedInterpolants, 0 QuantifiedInterpolants, 17793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3396 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 1994/2157 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: 1668]: Location Invariant Derived location invariant: ((((((((((a5 == 1) && (a12 == 1)) && (a27 <= 0)) || ((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a27 == 1))) || ((((((a5 == 1) && (a3 == 1)) && (a6 != 1)) && (a12 == 0)) && (a11 != 1)) && (a27 <= 0))) || ((((a26 == 1) && (a5 == 1)) && (a12 == 0)) && (a27 <= 0))) || ((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a27 == 1))) || (((a5 == 1) && (a12 == 0)) && (a27 == 1))) || ((((a5 == 1) && (2 <= a3)) && (a12 == 0)) && (a27 <= 0))) || ((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a27 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:12:40,875 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