./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label16.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8986a14436e34fef464bf499036d3f2f22e9dee8c68dd84a0eb0b1e3795f6f62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:45:24,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:45:24,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:45:24,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:45:24,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:45:24,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:45:24,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:45:24,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:45:24,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:45:24,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:45:24,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:45:24,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:45:24,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:45:24,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:45:24,556 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:45:24,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:45:24,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:45:24,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:45:24,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:45:24,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:45:24,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:45:24,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:45:24,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:45:24,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:45:24,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:45:24,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:45:24,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:45:24,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:45:24,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:45:24,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:45:24,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:45:24,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:45:24,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:45:24,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:45:24,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:45:24,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:45:24,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:45:24,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:45:24,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:45:24,559 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-jdk21/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 -> 8986a14436e34fef464bf499036d3f2f22e9dee8c68dd84a0eb0b1e3795f6f62 [2025-01-08 23:45:24,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:45:24,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:45:24,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:45:24,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:45:24,752 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:45:24,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label16.c [2025-01-08 23:45:25,841 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf72a5799/0dee926a90494e3584b78f3ec3d255d5/FLAGc7f846ff8 [2025-01-08 23:45:26,467 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:45:26,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label16.c [2025-01-08 23:45:26,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf72a5799/0dee926a90494e3584b78f3ec3d255d5/FLAGc7f846ff8 [2025-01-08 23:45:26,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf72a5799/0dee926a90494e3584b78f3ec3d255d5 [2025-01-08 23:45:26,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:45:26,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:45:26,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:45:26,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:45:26,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:45:26,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:45:26" (1/1) ... [2025-01-08 23:45:26,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d6b5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:26, skipping insertion in model container [2025-01-08 23:45:26,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:45:26" (1/1) ... [2025-01-08 23:45:26,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:45:26,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label16.c[8006,8019] [2025-01-08 23:45:27,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:45:27,325 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:45:27,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label16.c[8006,8019] [2025-01-08 23:45:27,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:45:27,611 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:45:27,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27 WrapperNode [2025-01-08 23:45:27,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:45:27,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:45:27,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:45:27,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:45:27,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:27,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:27,930 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:45:27,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:45:27,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:45:27,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:45:27,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:45:27,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:27,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,120 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-01-08 23:45:28,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,309 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:45:28,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:45:28,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:45:28,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:45:28,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (1/1) ... [2025-01-08 23:45:28,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:45:28,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:45:28,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:45:28,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:45:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:45:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:45:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:45:28,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:45:28,532 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:45:28,533 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:45:32,055 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:45:32,056 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:45:32,075 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:45:32,075 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:45:32,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:45:32 BoogieIcfgContainer [2025-01-08 23:45:32,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:45:32,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:45:32,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:45:32,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:45:32,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:45:26" (1/3) ... [2025-01-08 23:45:32,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338eb119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:45:32, skipping insertion in model container [2025-01-08 23:45:32,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:27" (2/3) ... [2025-01-08 23:45:32,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338eb119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:45:32, skipping insertion in model container [2025-01-08 23:45:32,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:45:32" (3/3) ... [2025-01-08 23:45:32,083 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label16.c [2025-01-08 23:45:32,105 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:45:32,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label16.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:45:32,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:45:32,202 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;@66fa2bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:45:32,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:45:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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-01-08 23:45:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-08 23:45:32,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:32,223 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] [2025-01-08 23:45:32,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:32,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1325338676, now seen corresponding path program 1 times [2025-01-08 23:45:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:32,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41718918] [2025-01-08 23:45:32,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:32,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-08 23:45:32,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-08 23:45:32,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:32,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:32,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:32,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41718918] [2025-01-08 23:45:32,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41718918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:32,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:32,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152275827] [2025-01-08 23:45:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:32,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:45:32,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:32,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:45:32,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:45:32,823 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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-01-08 23:45:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:38,429 INFO L93 Difference]: Finished difference Result 3142 states and 6126 transitions. [2025-01-08 23:45:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:45:38,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-01-08 23:45:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:38,487 INFO L225 Difference]: With dead ends: 3142 [2025-01-08 23:45:38,487 INFO L226 Difference]: Without dead ends: 2257 [2025-01-08 23:45:38,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:45:38,496 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 2191 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5499 mSolverCounterSat, 1273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 6772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1273 IncrementalHoareTripleChecker+Valid, 5499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:38,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 765 Invalid, 6772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1273 Valid, 5499 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-01-08 23:45:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-01-08 23:45:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-01-08 23:45:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5749113475177305) internal successors, (3553), 2256 states have internal predecessors, (3553), 0 states have call successors, (0), 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-01-08 23:45:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3553 transitions. [2025-01-08 23:45:38,637 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3553 transitions. Word has length 65 [2025-01-08 23:45:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:38,638 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3553 transitions. [2025-01-08 23:45:38,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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-01-08 23:45:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3553 transitions. [2025-01-08 23:45:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-08 23:45:38,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:38,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:38,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:45:38,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:38,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash -868828565, now seen corresponding path program 1 times [2025-01-08 23:45:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:38,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714412039] [2025-01-08 23:45:38,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:38,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:38,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-08 23:45:38,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-08 23:45:38,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:38,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:38,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:38,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714412039] [2025-01-08 23:45:38,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714412039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:38,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:38,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:38,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419693798] [2025-01-08 23:45:38,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:38,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:45:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:38,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:45:38,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:45:38,974 INFO L87 Difference]: Start difference. First operand 2257 states and 3553 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-01-08 23:45:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:42,480 INFO L93 Difference]: Finished difference Result 6051 states and 9916 transitions. [2025-01-08 23:45:42,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:45:42,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-01-08 23:45:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:42,501 INFO L225 Difference]: With dead ends: 6051 [2025-01-08 23:45:42,501 INFO L226 Difference]: Without dead ends: 3759 [2025-01-08 23:45:42,505 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-01-08 23:45:42,506 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 4443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:42,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 692 Invalid, 4443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3779 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:45:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2025-01-08 23:45:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3008. [2025-01-08 23:45:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4319920186232125) internal successors, (4306), 3007 states have internal predecessors, (4306), 0 states have call successors, (0), 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-01-08 23:45:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4306 transitions. [2025-01-08 23:45:42,562 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4306 transitions. Word has length 136 [2025-01-08 23:45:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:42,563 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4306 transitions. [2025-01-08 23:45:42,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-01-08 23:45:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4306 transitions. [2025-01-08 23:45:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-08 23:45:42,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:42,572 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:45:42,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:45:42,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash -465414336, now seen corresponding path program 1 times [2025-01-08 23:45:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746427808] [2025-01-08 23:45:42,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:42,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-08 23:45:42,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-08 23:45:42,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:42,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:45:42,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746427808] [2025-01-08 23:45:42,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746427808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:42,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:42,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:45:42,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133892528] [2025-01-08 23:45:42,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:42,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:42,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:42,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:42,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:42,817 INFO L87 Difference]: Start difference. First operand 3008 states and 4306 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-08 23:45:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:44,716 INFO L93 Difference]: Finished difference Result 8267 states and 11519 transitions. [2025-01-08 23:45:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 275 [2025-01-08 23:45:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:44,731 INFO L225 Difference]: With dead ends: 8267 [2025-01-08 23:45:44,731 INFO L226 Difference]: Without dead ends: 5261 [2025-01-08 23:45:44,734 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-01-08 23:45:44,734 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:44,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 427 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-08 23:45:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2025-01-08 23:45:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5261. [2025-01-08 23:45:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.1982889733840305) internal successors, (6303), 5260 states have internal predecessors, (6303), 0 states have call successors, (0), 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-01-08 23:45:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 6303 transitions. [2025-01-08 23:45:44,792 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 6303 transitions. Word has length 275 [2025-01-08 23:45:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:44,792 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 6303 transitions. [2025-01-08 23:45:44,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-08 23:45:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 6303 transitions. [2025-01-08 23:45:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-08 23:45:44,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:44,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:45:44,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:45:44,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:44,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash -281367355, now seen corresponding path program 1 times [2025-01-08 23:45:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:44,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142898645] [2025-01-08 23:45:44,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:44,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-08 23:45:44,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-08 23:45:44,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:44,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:45:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142898645] [2025-01-08 23:45:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142898645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:45,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:45,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:45,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921623471] [2025-01-08 23:45:45,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:45,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:45:45,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:45,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:45:45,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:45:45,170 INFO L87 Difference]: Start difference. First operand 5261 states and 6303 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-08 23:45:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:47,926 INFO L93 Difference]: Finished difference Result 12061 states and 15068 transitions. [2025-01-08 23:45:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:45:47,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 277 [2025-01-08 23:45:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:47,943 INFO L225 Difference]: With dead ends: 12061 [2025-01-08 23:45:47,943 INFO L226 Difference]: Without dead ends: 7516 [2025-01-08 23:45:47,947 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-01-08 23:45:47,947 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 3961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:47,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 326 Invalid, 3961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:45:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2025-01-08 23:45:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 7514. [2025-01-08 23:45:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7514 states, 7513 states have (on average 1.1812857713296951) internal successors, (8875), 7513 states have internal predecessors, (8875), 0 states have call successors, (0), 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-01-08 23:45:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7514 states to 7514 states and 8875 transitions. [2025-01-08 23:45:48,044 INFO L78 Accepts]: Start accepts. Automaton has 7514 states and 8875 transitions. Word has length 277 [2025-01-08 23:45:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:48,044 INFO L471 AbstractCegarLoop]: Abstraction has 7514 states and 8875 transitions. [2025-01-08 23:45:48,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-08 23:45:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 7514 states and 8875 transitions. [2025-01-08 23:45:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-08 23:45:48,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:48,048 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:48,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:45:48,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:48,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2020728095, now seen corresponding path program 1 times [2025-01-08 23:45:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:48,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245697214] [2025-01-08 23:45:48,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:48,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-08 23:45:48,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-08 23:45:48,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:48,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-08 23:45:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245697214] [2025-01-08 23:45:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245697214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028599173] [2025-01-08 23:45:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:48,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:48,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:48,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:48,522 INFO L87 Difference]: Start difference. First operand 7514 states and 8875 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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-01-08 23:45:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:51,020 INFO L93 Difference]: Finished difference Result 16528 states and 20146 transitions. [2025-01-08 23:45:51,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:51,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 354 [2025-01-08 23:45:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:51,041 INFO L225 Difference]: With dead ends: 16528 [2025-01-08 23:45:51,042 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:45:51,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:51,047 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 826 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 989 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 989 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:51,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 139 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [989 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:45:51,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:45:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-01-08 23:45:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.207352037681753) internal successors, (11791), 9766 states have internal predecessors, (11791), 0 states have call successors, (0), 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-01-08 23:45:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 11791 transitions. [2025-01-08 23:45:51,150 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 11791 transitions. Word has length 354 [2025-01-08 23:45:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:51,150 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 11791 transitions. [2025-01-08 23:45:51,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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-01-08 23:45:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 11791 transitions. [2025-01-08 23:45:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-01-08 23:45:51,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:51,156 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:51,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:45:51,157 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:51,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2024801763, now seen corresponding path program 1 times [2025-01-08 23:45:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021317639] [2025-01-08 23:45:51,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:51,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:51,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-01-08 23:45:51,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-01-08 23:45:51,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:51,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-08 23:45:51,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:51,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021317639] [2025-01-08 23:45:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021317639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587973453] [2025-01-08 23:45:51,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:51,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:51,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:51,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:51,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:51,605 INFO L87 Difference]: Start difference. First operand 9767 states and 11791 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-01-08 23:45:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:53,802 INFO L93 Difference]: Finished difference Result 21034 states and 25744 transitions. [2025-01-08 23:45:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:53,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-01-08 23:45:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:53,819 INFO L225 Difference]: With dead ends: 21034 [2025-01-08 23:45:53,819 INFO L226 Difference]: Without dead ends: 12020 [2025-01-08 23:45:53,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-01-08 23:45:53,823 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 725 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 725 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:53,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 105 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [725 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:45:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12020 states. [2025-01-08 23:45:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 12020. [2025-01-08 23:45:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.1926116981446044) internal successors, (14334), 12019 states have internal predecessors, (14334), 0 states have call successors, (0), 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-01-08 23:45:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 14334 transitions. [2025-01-08 23:45:53,943 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 14334 transitions. Word has length 378 [2025-01-08 23:45:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:53,944 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 14334 transitions. [2025-01-08 23:45:53,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-01-08 23:45:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 14334 transitions. [2025-01-08 23:45:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-08 23:45:53,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:53,948 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:45:53,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:45:53,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:53,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 704572770, now seen corresponding path program 1 times [2025-01-08 23:45:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109177578] [2025-01-08 23:45:53,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:53,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-08 23:45:54,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-08 23:45:54,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:54,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-08 23:45:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:54,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109177578] [2025-01-08 23:45:54,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109177578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:54,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:54,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478873164] [2025-01-08 23:45:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:54,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:54,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:54,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:54,304 INFO L87 Difference]: Start difference. First operand 12020 states and 14334 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-01-08 23:45:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:56,876 INFO L93 Difference]: Finished difference Result 33801 states and 40725 transitions. [2025-01-08 23:45:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 392 [2025-01-08 23:45:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:56,907 INFO L225 Difference]: With dead ends: 33801 [2025-01-08 23:45:56,907 INFO L226 Difference]: Without dead ends: 22534 [2025-01-08 23:45:56,914 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-01-08 23:45:56,914 INFO L435 NwaCegarLoop]: 1322 mSDtfsCounter, 636 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:56,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1329 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2678 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:45:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22534 states. [2025-01-08 23:45:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 21783. [2025-01-08 23:45:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21783 states, 21782 states have (on average 1.1774400881461757) internal successors, (25647), 21782 states have internal predecessors, (25647), 0 states have call successors, (0), 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-01-08 23:45:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21783 states to 21783 states and 25647 transitions. [2025-01-08 23:45:57,071 INFO L78 Accepts]: Start accepts. Automaton has 21783 states and 25647 transitions. Word has length 392 [2025-01-08 23:45:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:57,071 INFO L471 AbstractCegarLoop]: Abstraction has 21783 states and 25647 transitions. [2025-01-08 23:45:57,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-01-08 23:45:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 21783 states and 25647 transitions. [2025-01-08 23:45:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-08 23:45:57,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:57,076 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:57,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:45:57,076 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:57,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1147627478, now seen corresponding path program 1 times [2025-01-08 23:45:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:57,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179466851] [2025-01-08 23:45:57,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:57,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-08 23:45:57,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-08 23:45:57,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:57,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 89 proven. 99 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-08 23:45:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:57,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179466851] [2025-01-08 23:45:57,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179466851] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:45:57,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167389476] [2025-01-08 23:45:57,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:57,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:45:57,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:45:57,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:45:57,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:45:57,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-08 23:45:57,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-08 23:45:57,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:57,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:57,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:45:57,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:45:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-08 23:45:57,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:45:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167389476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:57,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:45:57,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-01-08 23:45:57,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490432300] [2025-01-08 23:45:57,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:57,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:57,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:57,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:45:57,971 INFO L87 Difference]: Start difference. First operand 21783 states and 25647 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-01-08 23:46:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:00,321 INFO L93 Difference]: Finished difference Result 59335 states and 70698 transitions. [2025-01-08 23:46:00,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:00,322 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 393 [2025-01-08 23:46:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:00,378 INFO L225 Difference]: With dead ends: 59335 [2025-01-08 23:46:00,378 INFO L226 Difference]: Without dead ends: 38305 [2025-01-08 23:46:00,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:46:00,392 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 697 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:00,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1377 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:46:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38305 states. [2025-01-08 23:46:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38305 to 36052. [2025-01-08 23:46:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36052 states, 36051 states have (on average 1.1419100718426674) internal successors, (41167), 36051 states have internal predecessors, (41167), 0 states have call successors, (0), 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-01-08 23:46:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36052 states to 36052 states and 41167 transitions. [2025-01-08 23:46:00,714 INFO L78 Accepts]: Start accepts. Automaton has 36052 states and 41167 transitions. Word has length 393 [2025-01-08 23:46:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:00,715 INFO L471 AbstractCegarLoop]: Abstraction has 36052 states and 41167 transitions. [2025-01-08 23:46:00,715 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-01-08 23:46:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 36052 states and 41167 transitions. [2025-01-08 23:46:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-01-08 23:46:00,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:00,721 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:46:00,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:46:00,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:00,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:00,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2015906028, now seen corresponding path program 1 times [2025-01-08 23:46:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:00,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56466560] [2025-01-08 23:46:00,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:01,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-01-08 23:46:01,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-01-08 23:46:01,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:01,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:46:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56466560] [2025-01-08 23:46:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56466560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:01,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:01,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194746728] [2025-01-08 23:46:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:01,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:01,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:01,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:01,404 INFO L87 Difference]: Start difference. First operand 36052 states and 41167 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-01-08 23:46:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:04,241 INFO L93 Difference]: Finished difference Result 87873 states and 101087 transitions. [2025-01-08 23:46:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:04,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 396 [2025-01-08 23:46:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:04,312 INFO L225 Difference]: With dead ends: 87873 [2025-01-08 23:46:04,312 INFO L226 Difference]: Without dead ends: 52574 [2025-01-08 23:46:04,325 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-01-08 23:46:04,326 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 709 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:04,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 335 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:46:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52574 states. [2025-01-08 23:46:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52574 to 50321. [2025-01-08 23:46:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50321 states, 50320 states have (on average 1.1420906200317964) internal successors, (57470), 50320 states have internal predecessors, (57470), 0 states have call successors, (0), 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-01-08 23:46:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50321 states to 50321 states and 57470 transitions. [2025-01-08 23:46:04,993 INFO L78 Accepts]: Start accepts. Automaton has 50321 states and 57470 transitions. Word has length 396 [2025-01-08 23:46:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:04,995 INFO L471 AbstractCegarLoop]: Abstraction has 50321 states and 57470 transitions. [2025-01-08 23:46:04,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-01-08 23:46:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 50321 states and 57470 transitions. [2025-01-08 23:46:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-08 23:46:05,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:05,007 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:46:05,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:46:05,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:05,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:05,008 INFO L85 PathProgramCache]: Analyzing trace with hash 388503457, now seen corresponding path program 1 times [2025-01-08 23:46:05,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:05,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269885955] [2025-01-08 23:46:05,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:05,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:05,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-08 23:46:05,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-08 23:46:05,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:05,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 618 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-08 23:46:05,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269885955] [2025-01-08 23:46:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269885955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303475477] [2025-01-08 23:46:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:05,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:05,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:05,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:05,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:05,218 INFO L87 Difference]: Start difference. First operand 50321 states and 57470 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-01-08 23:46:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:07,789 INFO L93 Difference]: Finished difference Result 124672 states and 144149 transitions. [2025-01-08 23:46:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:07,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 484 [2025-01-08 23:46:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:07,868 INFO L225 Difference]: With dead ends: 124672 [2025-01-08 23:46:07,868 INFO L226 Difference]: Without dead ends: 75104 [2025-01-08 23:46:07,896 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-01-08 23:46:07,897 INFO L435 NwaCegarLoop]: 1129 mSDtfsCounter, 754 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:07,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1136 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:46:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75104 states. [2025-01-08 23:46:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75104 to 70598. [2025-01-08 23:46:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70598 states, 70597 states have (on average 1.1449495021034888) internal successors, (80830), 70597 states have internal predecessors, (80830), 0 states have call successors, (0), 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-01-08 23:46:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70598 states to 70598 states and 80830 transitions. [2025-01-08 23:46:08,505 INFO L78 Accepts]: Start accepts. Automaton has 70598 states and 80830 transitions. Word has length 484 [2025-01-08 23:46:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:08,505 INFO L471 AbstractCegarLoop]: Abstraction has 70598 states and 80830 transitions. [2025-01-08 23:46:08,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-01-08 23:46:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 70598 states and 80830 transitions. [2025-01-08 23:46:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-01-08 23:46:08,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:08,514 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:46:08,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:46:08,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:08,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2000600270, now seen corresponding path program 1 times [2025-01-08 23:46:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781796976] [2025-01-08 23:46:08,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:08,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-01-08 23:46:08,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-01-08 23:46:08,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:08,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-08 23:46:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781796976] [2025-01-08 23:46:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781796976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:08,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:08,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:08,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876101297] [2025-01-08 23:46:08,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:08,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:08,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:08,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:08,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:08,951 INFO L87 Difference]: Start difference. First operand 70598 states and 80830 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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-01-08 23:46:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:11,627 INFO L93 Difference]: Finished difference Result 141945 states and 162403 transitions. [2025-01-08 23:46:11,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:11,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 498 [2025-01-08 23:46:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:11,730 INFO L225 Difference]: With dead ends: 141945 [2025-01-08 23:46:11,731 INFO L226 Difference]: Without dead ends: 72100 [2025-01-08 23:46:11,775 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-01-08 23:46:11,775 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 694 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:11,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1187 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:46:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72100 states. [2025-01-08 23:46:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72100 to 70598. [2025-01-08 23:46:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70598 states, 70597 states have (on average 1.125855206311883) internal successors, (79482), 70597 states have internal predecessors, (79482), 0 states have call successors, (0), 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-01-08 23:46:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70598 states to 70598 states and 79482 transitions. [2025-01-08 23:46:12,695 INFO L78 Accepts]: Start accepts. Automaton has 70598 states and 79482 transitions. Word has length 498 [2025-01-08 23:46:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:12,696 INFO L471 AbstractCegarLoop]: Abstraction has 70598 states and 79482 transitions. [2025-01-08 23:46:12,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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-01-08 23:46:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 70598 states and 79482 transitions. [2025-01-08 23:46:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-01-08 23:46:12,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:12,707 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:46:12,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:46:12,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:12,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2100618024, now seen corresponding path program 1 times [2025-01-08 23:46:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:12,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787951056] [2025-01-08 23:46:12,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:12,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:12,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-08 23:46:12,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-08 23:46:12,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:12,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 621 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-01-08 23:46:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787951056] [2025-01-08 23:46:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787951056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:13,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:13,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497991805] [2025-01-08 23:46:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:13,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:13,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:13,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:13,068 INFO L87 Difference]: Start difference. First operand 70598 states and 79482 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-01-08 23:46:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:15,771 INFO L93 Difference]: Finished difference Result 186254 states and 210135 transitions. [2025-01-08 23:46:15,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:15,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 502 [2025-01-08 23:46:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:15,897 INFO L225 Difference]: With dead ends: 186254 [2025-01-08 23:46:15,897 INFO L226 Difference]: Without dead ends: 116409 [2025-01-08 23:46:15,929 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-01-08 23:46:15,930 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 664 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:15,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1270 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:46:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116409 states. [2025-01-08 23:46:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116409 to 113405. [2025-01-08 23:46:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113405 states, 113404 states have (on average 1.103223872173821) internal successors, (125110), 113404 states have internal predecessors, (125110), 0 states have call successors, (0), 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-01-08 23:46:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113405 states to 113405 states and 125110 transitions. [2025-01-08 23:46:16,957 INFO L78 Accepts]: Start accepts. Automaton has 113405 states and 125110 transitions. Word has length 502 [2025-01-08 23:46:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:16,959 INFO L471 AbstractCegarLoop]: Abstraction has 113405 states and 125110 transitions. [2025-01-08 23:46:16,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-01-08 23:46:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 113405 states and 125110 transitions. [2025-01-08 23:46:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-01-08 23:46:16,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:16,971 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:46:16,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:46:16,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:16,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 457194506, now seen corresponding path program 1 times [2025-01-08 23:46:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424420332] [2025-01-08 23:46:16,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:17,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-01-08 23:46:17,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-01-08 23:46:17,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:17,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 732 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-01-08 23:46:17,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:17,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424420332] [2025-01-08 23:46:17,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424420332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:17,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:17,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835488043] [2025-01-08 23:46:17,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:17,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:17,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:17,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:17,254 INFO L87 Difference]: Start difference. First operand 113405 states and 125110 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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-01-08 23:46:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:19,820 INFO L93 Difference]: Finished difference Result 229061 states and 252499 transitions. [2025-01-08 23:46:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:19,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 538 [2025-01-08 23:46:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:19,937 INFO L225 Difference]: With dead ends: 229061 [2025-01-08 23:46:19,937 INFO L226 Difference]: Without dead ends: 112654 [2025-01-08 23:46:19,990 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-01-08 23:46:19,991 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 730 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:19,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1314 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-08 23:46:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112654 states. [2025-01-08 23:46:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112654 to 109650. [2025-01-08 23:46:21,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109650 states, 109649 states have (on average 1.0914098623790458) internal successors, (119672), 109649 states have internal predecessors, (119672), 0 states have call successors, (0), 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-01-08 23:46:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109650 states to 109650 states and 119672 transitions. [2025-01-08 23:46:21,512 INFO L78 Accepts]: Start accepts. Automaton has 109650 states and 119672 transitions. Word has length 538 [2025-01-08 23:46:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:21,512 INFO L471 AbstractCegarLoop]: Abstraction has 109650 states and 119672 transitions. [2025-01-08 23:46:21,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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-01-08 23:46:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 109650 states and 119672 transitions. [2025-01-08 23:46:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-01-08 23:46:21,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:21,521 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:46:21,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:46:21,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:21,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:21,521 INFO L85 PathProgramCache]: Analyzing trace with hash 289410014, now seen corresponding path program 1 times [2025-01-08 23:46:21,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:21,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232933117] [2025-01-08 23:46:21,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:21,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:21,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-01-08 23:46:21,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-01-08 23:46:21,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:21,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 819 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-01-08 23:46:21,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:21,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232933117] [2025-01-08 23:46:21,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232933117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:21,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:21,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757554199] [2025-01-08 23:46:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:21,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:21,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:21,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:21,708 INFO L87 Difference]: Start difference. First operand 109650 states and 119672 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-08 23:46:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:24,292 INFO L93 Difference]: Finished difference Result 218547 states and 238586 transitions. [2025-01-08 23:46:24,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:24,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 539 [2025-01-08 23:46:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:24,545 INFO L225 Difference]: With dead ends: 218547 [2025-01-08 23:46:24,545 INFO L226 Difference]: Without dead ends: 109650 [2025-01-08 23:46:24,611 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-01-08 23:46:24,611 INFO L435 NwaCegarLoop]: 1206 mSDtfsCounter, 694 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:24,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1214 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:46:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109650 states. [2025-01-08 23:46:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109650 to 108899. [2025-01-08 23:46:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108899 states, 108898 states have (on average 1.0848316773494462) internal successors, (118136), 108898 states have internal predecessors, (118136), 0 states have call successors, (0), 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-01-08 23:46:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108899 states to 108899 states and 118136 transitions. [2025-01-08 23:46:26,101 INFO L78 Accepts]: Start accepts. Automaton has 108899 states and 118136 transitions. Word has length 539 [2025-01-08 23:46:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:26,102 INFO L471 AbstractCegarLoop]: Abstraction has 108899 states and 118136 transitions. [2025-01-08 23:46:26,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-08 23:46:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 108899 states and 118136 transitions. [2025-01-08 23:46:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-01-08 23:46:26,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:26,114 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:46:26,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:46:26,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:26,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2040870483, now seen corresponding path program 1 times [2025-01-08 23:46:26,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:26,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002127906] [2025-01-08 23:46:26,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:26,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:26,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-01-08 23:46:26,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-01-08 23:46:26,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:26,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-01-08 23:46:26,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:26,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002127906] [2025-01-08 23:46:26,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002127906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:26,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:26,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:26,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311943051] [2025-01-08 23:46:26,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:26,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:26,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:26,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:26,339 INFO L87 Difference]: Start difference. First operand 108899 states and 118136 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-01-08 23:46:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:29,328 INFO L93 Difference]: Finished difference Result 233567 states and 253483 transitions. [2025-01-08 23:46:29,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:29,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 556 [2025-01-08 23:46:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:29,480 INFO L225 Difference]: With dead ends: 233567 [2025-01-08 23:46:29,480 INFO L226 Difference]: Without dead ends: 125421 [2025-01-08 23:46:29,531 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-01-08 23:46:29,532 INFO L435 NwaCegarLoop]: 1112 mSDtfsCounter, 808 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:29,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1120 Invalid, 2514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:46:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125421 states. [2025-01-08 23:46:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125421 to 123919. [2025-01-08 23:46:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123919 states, 123918 states have (on average 1.0792863022321213) internal successors, (133743), 123918 states have internal predecessors, (133743), 0 states have call successors, (0), 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-01-08 23:46:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123919 states to 123919 states and 133743 transitions. [2025-01-08 23:46:30,944 INFO L78 Accepts]: Start accepts. Automaton has 123919 states and 133743 transitions. Word has length 556 [2025-01-08 23:46:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:30,946 INFO L471 AbstractCegarLoop]: Abstraction has 123919 states and 133743 transitions. [2025-01-08 23:46:30,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-01-08 23:46:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 123919 states and 133743 transitions. [2025-01-08 23:46:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-01-08 23:46:30,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:30,975 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:46:30,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:46:30,976 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:30,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1512213875, now seen corresponding path program 1 times [2025-01-08 23:46:30,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:30,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334801829] [2025-01-08 23:46:30,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:31,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-01-08 23:46:31,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-01-08 23:46:31,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:31,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 811 proven. 251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:46:32,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334801829] [2025-01-08 23:46:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334801829] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:46:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402068091] [2025-01-08 23:46:32,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:46:32,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:46:32,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:46:32,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-01-08 23:46:33,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-01-08 23:46:33,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:33,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:33,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:46:33,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:46:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-01-08 23:46:33,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:46:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402068091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:33,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:46:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:46:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299614695] [2025-01-08 23:46:33,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:33,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:33,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:33,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:33,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:46:33,217 INFO L87 Difference]: Start difference. First operand 123919 states and 133743 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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-01-08 23:46:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:36,187 INFO L93 Difference]: Finished difference Result 290643 states and 314410 transitions. [2025-01-08 23:46:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:36,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 711 [2025-01-08 23:46:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:36,386 INFO L225 Difference]: With dead ends: 290643 [2025-01-08 23:46:36,386 INFO L226 Difference]: Without dead ends: 166726 [2025-01-08 23:46:36,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:46:36,461 INFO L435 NwaCegarLoop]: 1237 mSDtfsCounter, 728 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:36,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1245 Invalid, 2853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:46:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166726 states. [2025-01-08 23:46:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166726 to 163722. [2025-01-08 23:46:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163722 states, 163721 states have (on average 1.0758913028872288) internal successors, (176146), 163721 states have internal predecessors, (176146), 0 states have call successors, (0), 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-01-08 23:46:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163722 states to 163722 states and 176146 transitions. [2025-01-08 23:46:38,401 INFO L78 Accepts]: Start accepts. Automaton has 163722 states and 176146 transitions. Word has length 711 [2025-01-08 23:46:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:38,402 INFO L471 AbstractCegarLoop]: Abstraction has 163722 states and 176146 transitions. [2025-01-08 23:46:38,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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-01-08 23:46:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 163722 states and 176146 transitions. [2025-01-08 23:46:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2025-01-08 23:46:38,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:38,454 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:46:38,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:46:38,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 23:46:38,655 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:38,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1137554649, now seen corresponding path program 1 times [2025-01-08 23:46:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:38,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616696857] [2025-01-08 23:46:38,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:38,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes. [2025-01-08 23:46:38,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements. [2025-01-08 23:46:38,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:38,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 616 proven. 108 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-01-08 23:46:39,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:39,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616696857] [2025-01-08 23:46:39,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616696857] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:46:39,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611499969] [2025-01-08 23:46:39,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:39,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:39,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:46:39,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:46:39,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:46:39,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes. [2025-01-08 23:46:39,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements. [2025-01-08 23:46:39,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:39,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:39,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:46:39,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:46:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-01-08 23:46:40,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:46:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611499969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:40,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:46:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:46:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683875010] [2025-01-08 23:46:40,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:40,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:40,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:40,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:40,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:46:40,294 INFO L87 Difference]: Start difference. First operand 163722 states and 176146 transitions. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 2 states have internal predecessors, (630), 0 states have call successors, (0), 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-01-08 23:46:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:43,189 INFO L93 Difference]: Finished difference Result 326689 states and 351533 transitions. [2025-01-08 23:46:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:43,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 2 states have internal predecessors, (630), 0 states have call successors, (0), 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 909 [2025-01-08 23:46:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:43,191 INFO L225 Difference]: With dead ends: 326689 [2025-01-08 23:46:43,191 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:46:43,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 908 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-01-08 23:46:43,246 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 603 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:43,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 389 Invalid, 2644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:46:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:46:43,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:46:43,247 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-01-08 23:46:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:46:43,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 909 [2025-01-08 23:46:43,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:43,248 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:46:43,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 2 states have internal predecessors, (630), 0 states have call successors, (0), 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-01-08 23:46:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:46:43,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:46:43,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:46:43,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:46:43,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:43,454 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:43,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:46:47,377 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:46:47,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:46:47 BoogieIcfgContainer [2025-01-08 23:46:47,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:46:47,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:46:47,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:46:47,398 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:46:47,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:45:32" (3/4) ... [2025-01-08 23:46:47,401 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:46:47,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-08 23:46:47,452 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:46:47,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:46:47,459 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:46:47,696 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:46:47,697 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:46:47,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:46:47,699 INFO L158 Benchmark]: Toolchain (without parser) took 81179.70ms. Allocated memory was 142.6MB in the beginning and 11.5GB in the end (delta: 11.3GB). Free memory was 99.2MB in the beginning and 8.9GB in the end (delta: -8.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-01-08 23:46:47,699 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:46:47,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1098.47ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 99.2MB in the beginning and 68.7MB in the end (delta: 30.5MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2025-01-08 23:46:47,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 312.90ms. Allocated memory is still 151.0MB. Free memory was 68.7MB in the beginning and 49.5MB in the end (delta: 19.3MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2025-01-08 23:46:47,700 INFO L158 Benchmark]: Boogie Preprocessor took 496.62ms. Allocated memory was 151.0MB in the beginning and 302.0MB in the end (delta: 151.0MB). Free memory was 49.5MB in the beginning and 175.0MB in the end (delta: -125.5MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2025-01-08 23:46:47,700 INFO L158 Benchmark]: RCFGBuilder took 3647.39ms. Allocated memory was 302.0MB in the beginning and 394.3MB in the end (delta: 92.3MB). Free memory was 175.0MB in the beginning and 227.8MB in the end (delta: -52.8MB). Peak memory consumption was 223.7MB. Max. memory is 16.1GB. [2025-01-08 23:46:47,701 INFO L158 Benchmark]: TraceAbstraction took 75320.16ms. Allocated memory was 394.3MB in the beginning and 11.5GB in the end (delta: 11.1GB). Free memory was 227.8MB in the beginning and 8.9GB in the end (delta: -8.7GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-01-08 23:46:47,701 INFO L158 Benchmark]: Witness Printer took 299.06ms. Allocated memory is still 11.5GB. Free memory was 8.9GB in the beginning and 8.9GB in the end (delta: 58.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-08 23:46:47,702 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1098.47ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 99.2MB in the beginning and 68.7MB in the end (delta: 30.5MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 312.90ms. Allocated memory is still 151.0MB. Free memory was 68.7MB in the beginning and 49.5MB in the end (delta: 19.3MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 496.62ms. Allocated memory was 151.0MB in the beginning and 302.0MB in the end (delta: 151.0MB). Free memory was 49.5MB in the beginning and 175.0MB in the end (delta: -125.5MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3647.39ms. Allocated memory was 302.0MB in the beginning and 394.3MB in the end (delta: 92.3MB). Free memory was 175.0MB in the beginning and 227.8MB in the end (delta: -52.8MB). Peak memory consumption was 223.7MB. Max. memory is 16.1GB. * TraceAbstraction took 75320.16ms. Allocated memory was 394.3MB in the beginning and 11.5GB in the end (delta: 11.1GB). Free memory was 227.8MB in the beginning and 8.9GB in the end (delta: -8.7GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 299.06ms. Allocated memory is still 11.5GB. Free memory was 8.9GB in the beginning and 8.9GB in the end (delta: 58.4MB). Peak memory consumption was 58.7MB. 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: 217]: 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, 818 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.3s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 50.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13749 SdHoareTripleChecker+Valid, 43.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13749 mSDsluCounter, 14370 SdHoareTripleChecker+Invalid, 36.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 10138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43938 IncrementalHoareTripleChecker+Invalid, 54076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10138 mSolverCounterUnsat, 14210 mSDtfsCounter, 43938 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2074 GetRequests, 2040 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163722occurred in iteration=16, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 23283 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 9416 NumberOfCodeBlocks, 9416 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 9396 ConstructedInterpolants, 0 QuantifiedInterpolants, 23816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2459 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 11947/12405 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: 4828]: Loop Invariant Derived loop invariant: (((((((((((((((((a2 <= 170) && (a7 == 13)) || ((a7 == 12) && (a24 <= 13))) || ((a7 == 13) && (190 <= a2))) || ((a7 == 13) && (3 != a5))) || ((14 <= a7) && (15 <= a24))) || (((a2 <= 170) && (((long long) a17 + 124) <= 0)) && (3 == a5))) || ((3 != a5) && (a7 == 12))) || ((((a2 <= 170) && (a24 <= 14)) && (142 <= a17)) && (3 == a5))) || ((14 <= a7) && (3 != a5))) || ((190 <= a2) && (a7 == 12))) || ((a7 == 13) && (a24 <= 13))) || ((((a2 <= 170) && (a24 <= 14)) && (6 != a5)) && (((long long) a17 + 124) <= 0))) || (((a2 <= 170) && (a5 <= 4)) && (a24 <= 13))) || ((14 <= a7) && (190 <= a2))) || (((a2 <= 170) && (a24 <= 14)) && (a7 == 12))) || ((((a2 <= 170) && (a24 <= 14)) && (3 != a5)) && (a5 <= 4))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:46:47,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE