./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label54.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 83b9baf9f6deb0db64cb6e97ea77e31e0e6aa56bc46a9ba9c0c02a0377225524 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:02:27,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:02:27,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:02:27,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:02:27,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:02:27,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:02:27,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:02:27,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:02:27,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:02:27,269 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:02:27,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:02:27,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:02:27,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:02:27,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:02:27,269 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:02:27,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:02:27,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:02:27,269 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:02:27,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:02:27,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:02:27,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:02:27,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:02:27,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:02:27,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:02:27,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:02:27,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:02:27,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:02:27,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:02:27,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:02:27,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:02:27,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:02:27,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:02:27,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:02:27,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:02:27,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:02:27,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:02:27,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:02:27,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:02:27,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:02:27,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:02:27,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:02:27,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:02:27,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:02:27,273 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 -> 83b9baf9f6deb0db64cb6e97ea77e31e0e6aa56bc46a9ba9c0c02a0377225524 [2025-03-08 01:02:27,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:02:27,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:02:27,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:02:27,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:02:27,548 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:02:27,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label54.c [2025-03-08 01:02:28,700 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce966f10f/0bcc69be5b344d139cb52162a29a671c/FLAGa706f9c6f [2025-03-08 01:02:29,075 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:02:29,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label54.c [2025-03-08 01:02:29,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce966f10f/0bcc69be5b344d139cb52162a29a671c/FLAGa706f9c6f [2025-03-08 01:02:29,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce966f10f/0bcc69be5b344d139cb52162a29a671c [2025-03-08 01:02:29,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:02:29,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:02:29,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:02:29,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:02:29,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:02:29,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc0bd47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29, skipping insertion in model container [2025-03-08 01:02:29,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:02:29,424 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_label54.c[56627,56640] [2025-03-08 01:02:29,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:02:29,462 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:02:29,583 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_label54.c[56627,56640] [2025-03-08 01:02:29,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:02:29,617 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:02:29,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29 WrapperNode [2025-03-08 01:02:29,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:02:29,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:02:29,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:02:29,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:02:29,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,735 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-08 01:02:29,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:02:29,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:02:29,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:02:29,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:02:29,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,792 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:02:29,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:02:29,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:02:29,863 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:02:29,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:02:29,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (1/1) ... [2025-03-08 01:02:29,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:02:29,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:29,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:02:29,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:02:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:02:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:02:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:02:29,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:02:29,995 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:02:29,996 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:02:31,456 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-08 01:02:31,456 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:02:31,467 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:02:31,467 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:02:31,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:02:31 BoogieIcfgContainer [2025-03-08 01:02:31,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:02:31,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:02:31,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:02:31,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:02:31,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:02:29" (1/3) ... [2025-03-08 01:02:31,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ee512d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:02:31, skipping insertion in model container [2025-03-08 01:02:31,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:02:29" (2/3) ... [2025-03-08 01:02:31,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ee512d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:02:31, skipping insertion in model container [2025-03-08 01:02:31,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:02:31" (3/3) ... [2025-03-08 01:02:31,478 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label54.c [2025-03-08 01:02:31,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:02:31,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label54.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:02:31,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:02:31,564 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;@20e87ba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:02:31,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:02:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:31,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 01:02:31,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:31,582 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] [2025-03-08 01:02:31,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:31,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1201812113, now seen corresponding path program 1 times [2025-03-08 01:02:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14903999] [2025-03-08 01:02:31,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:31,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:31,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 01:02:31,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 01:02:31,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:31,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14903999] [2025-03-08 01:02:32,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14903999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:32,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216786978] [2025-03-08 01:02:32,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:32,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:32,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:32,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:32,348 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:33,209 INFO L93 Difference]: Finished difference Result 857 states and 1495 transitions. [2025-03-08 01:02:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:33,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 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 166 [2025-03-08 01:02:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:33,222 INFO L225 Difference]: With dead ends: 857 [2025-03-08 01:02:33,222 INFO L226 Difference]: Without dead ends: 462 [2025-03-08 01:02:33,225 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-08 01:02:33,227 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 122 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:33,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:02:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-08 01:02:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2025-03-08 01:02:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2025-03-08 01:02:33,292 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 166 [2025-03-08 01:02:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:33,294 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2025-03-08 01:02:33,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2025-03-08 01:02:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 01:02:33,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:33,297 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] [2025-03-08 01:02:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:02:33,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:33,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:33,302 INFO L85 PathProgramCache]: Analyzing trace with hash 61871463, now seen corresponding path program 1 times [2025-03-08 01:02:33,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:33,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408113673] [2025-03-08 01:02:33,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:33,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 01:02:33,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 01:02:33,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:33,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:33,508 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-08 01:02:33,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:33,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408113673] [2025-03-08 01:02:33,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408113673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:33,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:33,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:33,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676997988] [2025-03-08 01:02:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:33,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:33,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:33,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:33,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:33,511 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:34,160 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2025-03-08 01:02:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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 174 [2025-03-08 01:02:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:34,164 INFO L225 Difference]: With dead ends: 1344 [2025-03-08 01:02:34,164 INFO L226 Difference]: Without dead ends: 886 [2025-03-08 01:02:34,166 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-08 01:02:34,166 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 93 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:34,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 93 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-08 01:02:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2025-03-08 01:02:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5120828538550057) internal successors, (1314), 869 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1314 transitions. [2025-03-08 01:02:34,193 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1314 transitions. Word has length 174 [2025-03-08 01:02:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:34,193 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1314 transitions. [2025-03-08 01:02:34,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1314 transitions. [2025-03-08 01:02:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 01:02:34,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:34,200 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2025-03-08 01:02:34,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:02:34,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:34,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:34,201 INFO L85 PathProgramCache]: Analyzing trace with hash -345375744, now seen corresponding path program 1 times [2025-03-08 01:02:34,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:34,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114694090] [2025-03-08 01:02:34,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:34,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:34,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 01:02:34,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 01:02:34,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:34,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 01:02:34,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:34,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114694090] [2025-03-08 01:02:34,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114694090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:34,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964974329] [2025-03-08 01:02:34,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:34,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:34,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:34,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:02:34,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:02:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 01:02:34,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 01:02:34,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:34,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:34,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:34,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 01:02:34,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964974329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:34,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:02:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877624957] [2025-03-08 01:02:34,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:34,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:34,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:34,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:34,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:34,702 INFO L87 Difference]: Start difference. First operand 870 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:34,931 INFO L93 Difference]: Finished difference Result 2601 states and 3933 transitions. [2025-03-08 01:02:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:34,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2025-03-08 01:02:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:34,938 INFO L225 Difference]: With dead ends: 2601 [2025-03-08 01:02:34,938 INFO L226 Difference]: Without dead ends: 1733 [2025-03-08 01:02:34,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 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-08 01:02:34,940 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 360 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:34,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 601 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:02:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-03-08 01:02:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1729. [2025-03-08 01:02:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1728 states have (on average 1.5127314814814814) internal successors, (2614), 1728 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2614 transitions. [2025-03-08 01:02:34,974 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2614 transitions. Word has length 186 [2025-03-08 01:02:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:34,974 INFO L471 AbstractCegarLoop]: Abstraction has 1729 states and 2614 transitions. [2025-03-08 01:02:34,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2614 transitions. [2025-03-08 01:02:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 01:02:34,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:34,978 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-03-08 01:02:34,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 01:02:35,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:35,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:35,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1429886885, now seen corresponding path program 1 times [2025-03-08 01:02:35,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:35,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468855856] [2025-03-08 01:02:35,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:35,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:35,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 01:02:35,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 01:02:35,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:35,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:35,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:35,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468855856] [2025-03-08 01:02:35,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468855856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:35,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228648556] [2025-03-08 01:02:35,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:35,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:35,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:35,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:02:35,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 01:02:35,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 01:02:35,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 01:02:35,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:35,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:35,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:35,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:02:35,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228648556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:35,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:35,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 01:02:35,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288008547] [2025-03-08 01:02:35,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:35,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:35,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:35,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:35,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:35,623 INFO L87 Difference]: Start difference. First operand 1729 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:36,340 INFO L93 Difference]: Finished difference Result 5088 states and 7710 transitions. [2025-03-08 01:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:36,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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 188 [2025-03-08 01:02:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:36,351 INFO L225 Difference]: With dead ends: 5088 [2025-03-08 01:02:36,351 INFO L226 Difference]: Without dead ends: 3361 [2025-03-08 01:02:36,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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-08 01:02:36,354 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 230 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:36,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 416 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:02:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2025-03-08 01:02:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3357. [2025-03-08 01:02:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3356 states have (on average 1.33611442193087) internal successors, (4484), 3356 states have internal predecessors, (4484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4484 transitions. [2025-03-08 01:02:36,427 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4484 transitions. Word has length 188 [2025-03-08 01:02:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:36,427 INFO L471 AbstractCegarLoop]: Abstraction has 3357 states and 4484 transitions. [2025-03-08 01:02:36,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4484 transitions. [2025-03-08 01:02:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 01:02:36,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:36,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:36,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 01:02:36,634 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,SelfDestructingSolverStorable3 [2025-03-08 01:02:36,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:36,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash -719418772, now seen corresponding path program 1 times [2025-03-08 01:02:36,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:36,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348824304] [2025-03-08 01:02:36,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:36,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:36,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 01:02:36,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 01:02:36,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:36,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:36,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:36,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348824304] [2025-03-08 01:02:36,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348824304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:36,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:36,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:36,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3980711] [2025-03-08 01:02:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:36,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:36,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:36,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:36,803 INFO L87 Difference]: Start difference. First operand 3357 states and 4484 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:37,498 INFO L93 Difference]: Finished difference Result 9985 states and 13342 transitions. [2025-03-08 01:02:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:37,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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 189 [2025-03-08 01:02:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:37,518 INFO L225 Difference]: With dead ends: 9985 [2025-03-08 01:02:37,518 INFO L226 Difference]: Without dead ends: 6630 [2025-03-08 01:02:37,524 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-08 01:02:37,524 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 241 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:37,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 174 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2025-03-08 01:02:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 6626. [2025-03-08 01:02:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6626 states, 6625 states have (on average 1.284377358490566) internal successors, (8509), 6625 states have internal predecessors, (8509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 8509 transitions. [2025-03-08 01:02:37,681 INFO L78 Accepts]: Start accepts. Automaton has 6626 states and 8509 transitions. Word has length 189 [2025-03-08 01:02:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:37,681 INFO L471 AbstractCegarLoop]: Abstraction has 6626 states and 8509 transitions. [2025-03-08 01:02:37,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6626 states and 8509 transitions. [2025-03-08 01:02:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 01:02:37,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:37,691 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:37,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:02:37,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash -149700051, now seen corresponding path program 1 times [2025-03-08 01:02:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:37,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051411382] [2025-03-08 01:02:37,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:37,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:37,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 01:02:37,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 01:02:37,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:37,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 01:02:37,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:37,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051411382] [2025-03-08 01:02:37,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051411382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:37,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:37,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:37,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492675535] [2025-03-08 01:02:37,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:37,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:37,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:37,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:37,799 INFO L87 Difference]: Start difference. First operand 6626 states and 8509 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:38,162 INFO L93 Difference]: Finished difference Result 13186 states and 16930 transitions. [2025-03-08 01:02:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:38,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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 201 [2025-03-08 01:02:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:38,182 INFO L225 Difference]: With dead ends: 13186 [2025-03-08 01:02:38,183 INFO L226 Difference]: Without dead ends: 6562 [2025-03-08 01:02:38,191 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-08 01:02:38,191 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:38,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:02:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2025-03-08 01:02:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6562. [2025-03-08 01:02:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6562 states, 6561 states have (on average 1.255753696082914) internal successors, (8239), 6561 states have internal predecessors, (8239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 8239 transitions. [2025-03-08 01:02:38,400 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 8239 transitions. Word has length 201 [2025-03-08 01:02:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:38,401 INFO L471 AbstractCegarLoop]: Abstraction has 6562 states and 8239 transitions. [2025-03-08 01:02:38,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 8239 transitions. [2025-03-08 01:02:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 01:02:38,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:38,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:38,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:02:38,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:38,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -778878500, now seen corresponding path program 1 times [2025-03-08 01:02:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:38,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694661785] [2025-03-08 01:02:38,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:38,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:38,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 01:02:38,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 01:02:38,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:38,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:38,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:38,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694661785] [2025-03-08 01:02:38,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694661785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:38,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:38,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:38,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251898504] [2025-03-08 01:02:38,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:38,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:38,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:38,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:38,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:38,646 INFO L87 Difference]: Start difference. First operand 6562 states and 8239 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:39,348 INFO L93 Difference]: Finished difference Result 16394 states and 20524 transitions. [2025-03-08 01:02:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-03-08 01:02:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:39,377 INFO L225 Difference]: With dead ends: 16394 [2025-03-08 01:02:39,377 INFO L226 Difference]: Without dead ends: 9834 [2025-03-08 01:02:39,386 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-08 01:02:39,387 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 196 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:39,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 106 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2025-03-08 01:02:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9832. [2025-03-08 01:02:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9832 states, 9831 states have (on average 1.2396500864611941) internal successors, (12187), 9831 states have internal predecessors, (12187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9832 states to 9832 states and 12187 transitions. [2025-03-08 01:02:39,588 INFO L78 Accepts]: Start accepts. Automaton has 9832 states and 12187 transitions. Word has length 207 [2025-03-08 01:02:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:39,588 INFO L471 AbstractCegarLoop]: Abstraction has 9832 states and 12187 transitions. [2025-03-08 01:02:39,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 9832 states and 12187 transitions. [2025-03-08 01:02:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 01:02:39,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:39,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:39,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:02:39,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:39,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash -528604809, now seen corresponding path program 1 times [2025-03-08 01:02:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:39,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841385765] [2025-03-08 01:02:39,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:39,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:39,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 01:02:39,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 01:02:39,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:39,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:39,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:39,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841385765] [2025-03-08 01:02:39,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841385765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:39,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783463317] [2025-03-08 01:02:39,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:39,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:39,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:39,956 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-08 01:02:39,959 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-08 01:02:40,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 01:02:40,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 01:02:40,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:40,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:40,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:02:40,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:02:40,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783463317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:40,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:40,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:02:40,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848182228] [2025-03-08 01:02:40,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:40,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:40,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:40,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:40,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:40,259 INFO L87 Difference]: Start difference. First operand 9832 states and 12187 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:40,955 INFO L93 Difference]: Finished difference Result 28620 states and 35524 transitions. [2025-03-08 01:02:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:40,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 214 [2025-03-08 01:02:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:40,991 INFO L225 Difference]: With dead ends: 28620 [2025-03-08 01:02:40,991 INFO L226 Difference]: Without dead ends: 18790 [2025-03-08 01:02:41,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:41,002 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 71 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:41,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 354 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18790 states. [2025-03-08 01:02:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18790 to 18780. [2025-03-08 01:02:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18780 states, 18779 states have (on average 1.2087438095745247) internal successors, (22699), 18779 states have internal predecessors, (22699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18780 states to 18780 states and 22699 transitions. [2025-03-08 01:02:41,319 INFO L78 Accepts]: Start accepts. Automaton has 18780 states and 22699 transitions. Word has length 214 [2025-03-08 01:02:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:41,319 INFO L471 AbstractCegarLoop]: Abstraction has 18780 states and 22699 transitions. [2025-03-08 01:02:41,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 18780 states and 22699 transitions. [2025-03-08 01:02:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 01:02:41,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:41,342 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:02:41,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 01:02:41,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:41,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:41,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash -864540969, now seen corresponding path program 1 times [2025-03-08 01:02:41,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:41,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943556129] [2025-03-08 01:02:41,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:41,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 01:02:41,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 01:02:41,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:41,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 01:02:41,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:41,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943556129] [2025-03-08 01:02:41,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943556129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:41,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:41,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437266417] [2025-03-08 01:02:41,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:41,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:41,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:41,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:41,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:41,762 INFO L87 Difference]: Start difference. First operand 18780 states and 22699 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-08 01:02:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:42,473 INFO L93 Difference]: Finished difference Result 45069 states and 55536 transitions. [2025-03-08 01:02:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:42,473 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 227 [2025-03-08 01:02:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:42,528 INFO L225 Difference]: With dead ends: 45069 [2025-03-08 01:02:42,528 INFO L226 Difference]: Without dead ends: 26291 [2025-03-08 01:02:42,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:42,552 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:42,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 148 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26291 states. [2025-03-08 01:02:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26291 to 26291. [2025-03-08 01:02:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26291 states, 26290 states have (on average 1.1729554963864588) internal successors, (30837), 26290 states have internal predecessors, (30837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26291 states to 26291 states and 30837 transitions. [2025-03-08 01:02:43,049 INFO L78 Accepts]: Start accepts. Automaton has 26291 states and 30837 transitions. Word has length 227 [2025-03-08 01:02:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:43,051 INFO L471 AbstractCegarLoop]: Abstraction has 26291 states and 30837 transitions. [2025-03-08 01:02:43,051 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-08 01:02:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 26291 states and 30837 transitions. [2025-03-08 01:02:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-08 01:02:43,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:43,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:43,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:02:43,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:43,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1914872660, now seen corresponding path program 1 times [2025-03-08 01:02:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:43,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758644291] [2025-03-08 01:02:43,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:43,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-08 01:02:43,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-08 01:02:43,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:43,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:43,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758644291] [2025-03-08 01:02:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758644291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:43,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:43,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696068100] [2025-03-08 01:02:43,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:43,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:43,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:43,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:43,249 INFO L87 Difference]: Start difference. First operand 26291 states and 30837 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:44,071 INFO L93 Difference]: Finished difference Result 66623 states and 78695 transitions. [2025-03-08 01:02:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2025-03-08 01:02:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:44,139 INFO L225 Difference]: With dead ends: 66623 [2025-03-08 01:02:44,139 INFO L226 Difference]: Without dead ends: 40334 [2025-03-08 01:02:44,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:44,158 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 63 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:44,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 326 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40334 states. [2025-03-08 01:02:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40334 to 40298. [2025-03-08 01:02:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40298 states, 40297 states have (on average 1.171997915477579) internal successors, (47228), 40297 states have internal predecessors, (47228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40298 states to 40298 states and 47228 transitions. [2025-03-08 01:02:44,794 INFO L78 Accepts]: Start accepts. Automaton has 40298 states and 47228 transitions. Word has length 240 [2025-03-08 01:02:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:44,795 INFO L471 AbstractCegarLoop]: Abstraction has 40298 states and 47228 transitions. [2025-03-08 01:02:44,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 40298 states and 47228 transitions. [2025-03-08 01:02:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-08 01:02:44,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:44,822 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:02:44,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:02:44,822 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:44,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 769276432, now seen corresponding path program 1 times [2025-03-08 01:02:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621986326] [2025-03-08 01:02:44,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:44,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 01:02:44,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 01:02:44,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:44,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 01:02:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621986326] [2025-03-08 01:02:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621986326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:44,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:44,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905678720] [2025-03-08 01:02:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:44,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:44,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:44,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:44,994 INFO L87 Difference]: Start difference. First operand 40298 states and 47228 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:45,907 INFO L93 Difference]: Finished difference Result 102381 states and 119861 transitions. [2025-03-08 01:02:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 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 254 [2025-03-08 01:02:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:45,993 INFO L225 Difference]: With dead ends: 102381 [2025-03-08 01:02:45,993 INFO L226 Difference]: Without dead ends: 62085 [2025-03-08 01:02:46,026 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-08 01:02:46,026 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 157 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:46,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 152 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:02:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62085 states. [2025-03-08 01:02:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62085 to 61673. [2025-03-08 01:02:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61673 states, 61672 states have (on average 1.1690718640550006) internal successors, (72099), 61672 states have internal predecessors, (72099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61673 states to 61673 states and 72099 transitions. [2025-03-08 01:02:47,295 INFO L78 Accepts]: Start accepts. Automaton has 61673 states and 72099 transitions. Word has length 254 [2025-03-08 01:02:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:47,295 INFO L471 AbstractCegarLoop]: Abstraction has 61673 states and 72099 transitions. [2025-03-08 01:02:47,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:47,296 INFO L276 IsEmpty]: Start isEmpty. Operand 61673 states and 72099 transitions. [2025-03-08 01:02:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-08 01:02:47,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:47,330 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:02:47,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:02:47,330 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:47,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash -698254059, now seen corresponding path program 2 times [2025-03-08 01:02:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736705257] [2025-03-08 01:02:47,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 01:02:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:47,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 261 statements into 2 equivalence classes. [2025-03-08 01:02:47,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 01:02:47,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 01:02:47,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 01:02:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736705257] [2025-03-08 01:02:47,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736705257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:47,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:47,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:47,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990558237] [2025-03-08 01:02:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:47,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:47,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:47,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:47,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:47,599 INFO L87 Difference]: Start difference. First operand 61673 states and 72099 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:48,356 INFO L93 Difference]: Finished difference Result 117420 states and 136593 transitions. [2025-03-08 01:02:48,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:48,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-03-08 01:02:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:48,438 INFO L225 Difference]: With dead ends: 117420 [2025-03-08 01:02:48,438 INFO L226 Difference]: Without dead ends: 55749 [2025-03-08 01:02:48,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:48,480 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 94 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:48,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 333 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:02:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55749 states. [2025-03-08 01:02:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55749 to 55742. [2025-03-08 01:02:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55742 states, 55741 states have (on average 1.1270519007552788) internal successors, (62823), 55741 states have internal predecessors, (62823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55742 states to 55742 states and 62823 transitions. [2025-03-08 01:02:49,394 INFO L78 Accepts]: Start accepts. Automaton has 55742 states and 62823 transitions. Word has length 261 [2025-03-08 01:02:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:49,395 INFO L471 AbstractCegarLoop]: Abstraction has 55742 states and 62823 transitions. [2025-03-08 01:02:49,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 55742 states and 62823 transitions. [2025-03-08 01:02:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-08 01:02:49,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:49,434 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:02:49,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:02:49,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:49,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash 601359292, now seen corresponding path program 1 times [2025-03-08 01:02:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774363410] [2025-03-08 01:02:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:49,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:49,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-08 01:02:49,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-08 01:02:49,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:49,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 01:02:50,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774363410] [2025-03-08 01:02:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774363410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9935784] [2025-03-08 01:02:50,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:50,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:50,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:50,483 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-08 01:02:50,484 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-08 01:02:50,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-08 01:02:50,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-08 01:02:50,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:50,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:50,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:50,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 01:02:50,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:50,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9935784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:50,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:50,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-08 01:02:50,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463899788] [2025-03-08 01:02:50,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:50,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:50,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:50,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:02:50,777 INFO L87 Difference]: Start difference. First operand 55742 states and 62823 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:51,517 INFO L93 Difference]: Finished difference Result 111517 states and 125707 transitions. [2025-03-08 01:02:51,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:51,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 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 267 [2025-03-08 01:02:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:51,600 INFO L225 Difference]: With dead ends: 111517 [2025-03-08 01:02:51,601 INFO L226 Difference]: Without dead ends: 55777 [2025-03-08 01:02:51,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 266 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-08 01:02:51,649 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 154 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:51,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 158 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:02:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55777 states. [2025-03-08 01:02:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55777 to 55742. [2025-03-08 01:02:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55742 states, 55741 states have (on average 1.1245044042984518) internal successors, (62681), 55741 states have internal predecessors, (62681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55742 states to 55742 states and 62681 transitions. [2025-03-08 01:02:52,402 INFO L78 Accepts]: Start accepts. Automaton has 55742 states and 62681 transitions. Word has length 267 [2025-03-08 01:02:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:52,402 INFO L471 AbstractCegarLoop]: Abstraction has 55742 states and 62681 transitions. [2025-03-08 01:02:52,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 55742 states and 62681 transitions. [2025-03-08 01:02:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-08 01:02:52,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:52,443 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:52,452 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-08 01:02:52,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:52,643 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:52,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash 844210042, now seen corresponding path program 1 times [2025-03-08 01:02:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:52,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276034681] [2025-03-08 01:02:52,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:52,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-08 01:02:52,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-08 01:02:52,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:52,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 01:02:52,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:52,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276034681] [2025-03-08 01:02:52,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276034681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:52,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:52,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524009355] [2025-03-08 01:02:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:52,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:02:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:52,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:02:52,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:52,965 INFO L87 Difference]: Start difference. First operand 55742 states and 62681 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:54,033 INFO L93 Difference]: Finished difference Result 114764 states and 129006 transitions. [2025-03-08 01:02:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:02:54,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 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 281 [2025-03-08 01:02:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:54,110 INFO L225 Difference]: With dead ends: 114764 [2025-03-08 01:02:54,110 INFO L226 Difference]: Without dead ends: 59024 [2025-03-08 01:02:54,152 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-08 01:02:54,152 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 473 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:54,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 82 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:02:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59024 states. [2025-03-08 01:02:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59024 to 58990. [2025-03-08 01:02:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58990 states, 58989 states have (on average 1.105629863194833) internal successors, (65220), 58989 states have internal predecessors, (65220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58990 states to 58990 states and 65220 transitions. [2025-03-08 01:02:54,988 INFO L78 Accepts]: Start accepts. Automaton has 58990 states and 65220 transitions. Word has length 281 [2025-03-08 01:02:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:54,988 INFO L471 AbstractCegarLoop]: Abstraction has 58990 states and 65220 transitions. [2025-03-08 01:02:54,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 58990 states and 65220 transitions. [2025-03-08 01:02:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-08 01:02:55,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:55,012 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:55,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:02:55,012 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:55,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash -625696802, now seen corresponding path program 1 times [2025-03-08 01:02:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:55,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050628479] [2025-03-08 01:02:55,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:55,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:55,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-08 01:02:55,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-08 01:02:55,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:55,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-08 01:02:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050628479] [2025-03-08 01:02:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050628479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152103756] [2025-03-08 01:02:55,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:55,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:55,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:55,400 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-08 01:02:55,401 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-08 01:02:55,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-08 01:02:55,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-08 01:02:55,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:55,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:55,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:55,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 01:02:55,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:55,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152103756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:55,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:55,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:02:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445527909] [2025-03-08 01:02:55,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:55,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:55,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:55,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:55,561 INFO L87 Difference]: Start difference. First operand 58990 states and 65220 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:56,307 INFO L93 Difference]: Finished difference Result 117581 states and 130029 transitions. [2025-03-08 01:02:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:56,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 293 [2025-03-08 01:02:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:56,381 INFO L225 Difference]: With dead ends: 117581 [2025-03-08 01:02:56,381 INFO L226 Difference]: Without dead ends: 58593 [2025-03-08 01:02:56,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 292 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-08 01:02:56,402 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 251 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 290 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:56,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 290 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:02:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58593 states. [2025-03-08 01:02:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58593 to 58584. [2025-03-08 01:02:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58584 states, 58583 states have (on average 1.1020603246675658) internal successors, (64562), 58583 states have internal predecessors, (64562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58584 states to 58584 states and 64562 transitions. [2025-03-08 01:02:57,053 INFO L78 Accepts]: Start accepts. Automaton has 58584 states and 64562 transitions. Word has length 293 [2025-03-08 01:02:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:57,054 INFO L471 AbstractCegarLoop]: Abstraction has 58584 states and 64562 transitions. [2025-03-08 01:02:57,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 58584 states and 64562 transitions. [2025-03-08 01:02:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-08 01:02:57,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:57,099 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:02:57,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 01:02:57,299 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,SelfDestructingSolverStorable14 [2025-03-08 01:02:57,299 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:57,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1298287333, now seen corresponding path program 1 times [2025-03-08 01:02:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:57,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807455744] [2025-03-08 01:02:57,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:57,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:57,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-08 01:02:57,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-08 01:02:57,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:57,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 122 proven. 6 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-08 01:02:57,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807455744] [2025-03-08 01:02:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807455744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937761473] [2025-03-08 01:02:57,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:57,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:57,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:57,876 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-08 01:02:57,876 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-08 01:02:57,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-08 01:02:58,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-08 01:02:58,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:58,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:58,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:02:58,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 01:02:58,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:58,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937761473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:58,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:58,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:02:58,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240524923] [2025-03-08 01:02:58,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:58,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:58,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:58,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:58,083 INFO L87 Difference]: Start difference. First operand 58584 states and 64562 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-08 01:02:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:58,687 INFO L93 Difference]: Finished difference Result 163301 states and 179881 transitions. [2025-03-08 01:02:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:58,688 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 363 [2025-03-08 01:02:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:58,822 INFO L225 Difference]: With dead ends: 163301 [2025-03-08 01:02:58,823 INFO L226 Difference]: Without dead ends: 104719 [2025-03-08 01:02:58,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 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-08 01:02:58,866 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 290 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:58,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 843 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 01:02:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104719 states. [2025-03-08 01:03:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104719 to 104715. [2025-03-08 01:03:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104715 states, 104714 states have (on average 1.0925473193651278) internal successors, (114405), 104714 states have internal predecessors, (114405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104715 states to 104715 states and 114405 transitions. [2025-03-08 01:03:00,522 INFO L78 Accepts]: Start accepts. Automaton has 104715 states and 114405 transitions. Word has length 363 [2025-03-08 01:03:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:03:00,522 INFO L471 AbstractCegarLoop]: Abstraction has 104715 states and 114405 transitions. [2025-03-08 01:03:00,523 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-08 01:03:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 104715 states and 114405 transitions. [2025-03-08 01:03:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 01:03:00,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:03:00,610 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:03:00,617 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-08 01:03:00,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 01:03:00,811 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:03:00,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:03:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2037438597, now seen corresponding path program 1 times [2025-03-08 01:03:00,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:03:00,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313484129] [2025-03-08 01:03:00,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:03:00,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:03:00,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 01:03:00,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 01:03:00,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:03:00,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:03:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 115 proven. 6 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-08 01:03:01,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:03:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313484129] [2025-03-08 01:03:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313484129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:03:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920596111] [2025-03-08 01:03:01,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:03:01,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:03:01,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:03:01,271 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-08 01:03:01,271 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-08 01:03:01,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 01:03:01,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 01:03:01,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:03:01,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:03:01,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:03:01,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:03:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-08 01:03:01,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:03:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920596111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:03:01,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:03:01,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:03:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898312983] [2025-03-08 01:03:01,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:03:01,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:03:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:03:01,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:03:01,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:03:01,488 INFO L87 Difference]: Start difference. First operand 104715 states and 114405 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:03:02,423 INFO L93 Difference]: Finished difference Result 203937 states and 222752 transitions. [2025-03-08 01:03:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:03:02,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 378 [2025-03-08 01:03:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:03:02,426 INFO L225 Difference]: With dead ends: 203937 [2025-03-08 01:03:02,426 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:03:02,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 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-08 01:03:02,494 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 242 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:03:02,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 309 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:03:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:03:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:03:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:03:02,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 378 [2025-03-08 01:03:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:03:02,495 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:03:02,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:03:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:03:02,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:03:02,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:03:02,504 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-08 01:03:02,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:03:02,701 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:03:02,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:03:09,150 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 01:03:09,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:03:09 BoogieIcfgContainer [2025-03-08 01:03:09,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 01:03:09,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 01:03:09,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 01:03:09,167 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 01:03:09,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:02:31" (3/4) ... [2025-03-08 01:03:09,169 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 01:03:09,191 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 01:03:09,193 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 01:03:09,194 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 01:03:09,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 01:03:09,326 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 01:03:09,326 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 01:03:09,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 01:03:09,327 INFO L158 Benchmark]: Toolchain (without parser) took 40221.41ms. Allocated memory was 142.6MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 98.3MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-03-08 01:03:09,327 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 01:03:09,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.90ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 39.2MB in the end (delta: 59.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 01:03:09,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.46ms. Allocated memory is still 142.6MB. Free memory was 39.2MB in the beginning and 91.0MB in the end (delta: -51.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2025-03-08 01:03:09,328 INFO L158 Benchmark]: Boogie Preprocessor took 124.49ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 79.9MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 01:03:09,328 INFO L158 Benchmark]: IcfgBuilder took 1605.85ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 79.9MB in the beginning and 195.4MB in the end (delta: -115.5MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2025-03-08 01:03:09,328 INFO L158 Benchmark]: TraceAbstraction took 37694.14ms. Allocated memory was 318.8MB in the beginning and 7.7GB in the end (delta: 7.4GB). Free memory was 194.4MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 5.4GB. Max. memory is 16.1GB. [2025-03-08 01:03:09,328 INFO L158 Benchmark]: Witness Printer took 159.37ms. Allocated memory is still 7.7GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 01:03:09,329 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.86ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.90ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 39.2MB in the end (delta: 59.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.46ms. Allocated memory is still 142.6MB. Free memory was 39.2MB in the beginning and 91.0MB in the end (delta: -51.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.49ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 79.9MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1605.85ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 79.9MB in the beginning and 195.4MB in the end (delta: -115.5MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * TraceAbstraction took 37694.14ms. Allocated memory was 318.8MB in the beginning and 7.7GB in the end (delta: 7.4GB). Free memory was 194.4MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 5.4GB. Max. memory is 16.1GB. * Witness Printer took 159.37ms. Allocated memory is still 7.7GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 1543]: 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, 302 locations, 518 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.2s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3726 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3726 mSDsluCounter, 4603 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 844 mSDsCounter, 1769 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9080 IncrementalHoareTripleChecker+Invalid, 10849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1769 mSolverCounterUnsat, 3759 mSDtfsCounter, 9080 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1929 GetRequests, 1896 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104715occurred in iteration=16, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 579 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 5978 NumberOfCodeBlocks, 5978 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5954 ConstructedInterpolants, 0 QuantifiedInterpolants, 12611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3860 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 24 InterpolantComputations, 17 PerfectInterpolantSequences, 3146/3198 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) && (a3 <= 0)) && (a26 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) || (((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0))) || ((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0))) || (((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a26 <= 0)) && (a11 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a6 <= 0))) || ((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1))) || (((((a26 == 1) && (a5 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 <= 0))) || (((((((a25 == 1) && (a5 == 1)) && (a12 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1))) || (((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a10 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || (((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 01:03:09,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE