./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c10298174dc8a10464920798633331c54bfb52691f05a28be9f9c0183eefe1d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:12:59,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:12:59,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:12:59,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:12:59,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:12:59,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:12:59,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:12:59,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:12:59,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:12:59,172 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:12:59,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:12:59,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:12:59,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:12:59,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:12:59,173 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:12:59,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:12:59,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:12:59,173 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:12:59,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:12:59,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:12:59,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:12:59,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:12:59,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:12:59,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:12:59,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:12:59,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:12:59,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:12:59,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:12:59,175 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10298174dc8a10464920798633331c54bfb52691f05a28be9f9c0183eefe1d6 [2025-03-16 19:12:59,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:12:59,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:12:59,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:12:59,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:12:59,410 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:12:59,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.1.ufo.UNBOUNDED.pals.c [2025-03-16 19:13:00,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6a68529/2a2cb57489e04fb0b568e61a8232b4e5/FLAG9f76be197 [2025-03-16 19:13:00,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:13:00,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.1.ufo.UNBOUNDED.pals.c [2025-03-16 19:13:00,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6a68529/2a2cb57489e04fb0b568e61a8232b4e5/FLAG9f76be197 [2025-03-16 19:13:01,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6a68529/2a2cb57489e04fb0b568e61a8232b4e5 [2025-03-16 19:13:01,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:13:01,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:13:01,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:13:01,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:13:01,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:13:01,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01, skipping insertion in model container [2025-03-16 19:13:01,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:13:01,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.1.ufo.UNBOUNDED.pals.c[55979,55992] [2025-03-16 19:13:01,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:13:01,567 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:13:01,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.1.ufo.UNBOUNDED.pals.c[55979,55992] [2025-03-16 19:13:01,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:13:01,656 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:13:01,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01 WrapperNode [2025-03-16 19:13:01,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:13:01,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:13:01,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:13:01,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:13:01,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,749 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2099 [2025-03-16 19:13:01,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:13:01,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:13:01,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:13:01,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:13:01,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,791 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:13:01,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:13:01,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:13:01,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:13:01,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:13:01,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (1/1) ... [2025-03-16 19:13:01,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:13:01,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:13:01,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:13:01,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:13:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:13:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:13:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:13:01,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:13:02,026 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:13:02,028 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:13:03,554 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2025-03-16 19:13:03,555 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:13:03,579 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:13:03,583 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:13:03,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:13:03 BoogieIcfgContainer [2025-03-16 19:13:03,584 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:13:03,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:13:03,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:13:03,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:13:03,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:13:01" (1/3) ... [2025-03-16 19:13:03,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3669be4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:13:03, skipping insertion in model container [2025-03-16 19:13:03,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:13:01" (2/3) ... [2025-03-16 19:13:03,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3669be4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:13:03, skipping insertion in model container [2025-03-16 19:13:03,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:13:03" (3/3) ... [2025-03-16 19:13:03,602 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.UNBOUNDED.pals.c [2025-03-16 19:13:03,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:13:03,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.5.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 681 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:13:03,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:13:03,700 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;@1416f608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:13:03,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:13:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 681 states, 679 states have (on average 1.865979381443299) internal successors, (1267), 680 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:13:03,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:03,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:03,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:03,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 423705585, now seen corresponding path program 1 times [2025-03-16 19:13:03,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:03,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388440090] [2025-03-16 19:13:03,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:03,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:13:04,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:13:04,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:04,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:04,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388440090] [2025-03-16 19:13:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388440090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:04,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:04,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:13:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884002004] [2025-03-16 19:13:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:04,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:13:04,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:04,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:13:04,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:13:04,283 INFO L87 Difference]: Start difference. First operand has 681 states, 679 states have (on average 1.865979381443299) internal successors, (1267), 680 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:04,326 INFO L93 Difference]: Finished difference Result 832 states and 1539 transitions. [2025-03-16 19:13:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:13:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-16 19:13:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:04,340 INFO L225 Difference]: With dead ends: 832 [2025-03-16 19:13:04,341 INFO L226 Difference]: Without dead ends: 679 [2025-03-16 19:13:04,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:13:04,345 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:04,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-16 19:13:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-03-16 19:13:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.8628318584070795) internal successors, (1263), 678 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1263 transitions. [2025-03-16 19:13:04,423 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1263 transitions. Word has length 150 [2025-03-16 19:13:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:04,424 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1263 transitions. [2025-03-16 19:13:04,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1263 transitions. [2025-03-16 19:13:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:13:04,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:04,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:04,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:13:04,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:04,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1385319602, now seen corresponding path program 1 times [2025-03-16 19:13:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:04,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061252059] [2025-03-16 19:13:04,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:04,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:13:05,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:13:05,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:05,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:05,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061252059] [2025-03-16 19:13:05,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061252059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:05,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:05,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:05,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947260835] [2025-03-16 19:13:05,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:05,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:05,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:05,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:05,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:05,646 INFO L87 Difference]: Start difference. First operand 679 states and 1263 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:05,764 INFO L93 Difference]: Finished difference Result 832 states and 1535 transitions. [2025-03-16 19:13:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:05,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-16 19:13:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:05,769 INFO L225 Difference]: With dead ends: 832 [2025-03-16 19:13:05,770 INFO L226 Difference]: Without dead ends: 679 [2025-03-16 19:13:05,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:05,773 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 0 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3737 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:05,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3737 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-16 19:13:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-03-16 19:13:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.7964601769911503) internal successors, (1218), 678 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1218 transitions. [2025-03-16 19:13:05,804 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1218 transitions. Word has length 150 [2025-03-16 19:13:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:05,804 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1218 transitions. [2025-03-16 19:13:05,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1218 transitions. [2025-03-16 19:13:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 19:13:05,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:05,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:05,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:13:05,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:05,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:05,811 INFO L85 PathProgramCache]: Analyzing trace with hash -853368250, now seen corresponding path program 1 times [2025-03-16 19:13:05,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:05,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868550381] [2025-03-16 19:13:05,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:05,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:05,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 19:13:05,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 19:13:05,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:05,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:06,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868550381] [2025-03-16 19:13:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868550381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:06,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:06,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278632142] [2025-03-16 19:13:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:06,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:06,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:06,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:06,088 INFO L87 Difference]: Start difference. First operand 679 states and 1218 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:06,208 INFO L93 Difference]: Finished difference Result 965 states and 1730 transitions. [2025-03-16 19:13:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2025-03-16 19:13:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:06,214 INFO L225 Difference]: With dead ends: 965 [2025-03-16 19:13:06,214 INFO L226 Difference]: Without dead ends: 815 [2025-03-16 19:13:06,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:06,217 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 234 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:06,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 2380 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-16 19:13:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 812. [2025-03-16 19:13:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.7916152897657214) internal successors, (1453), 811 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1453 transitions. [2025-03-16 19:13:06,235 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1453 transitions. Word has length 194 [2025-03-16 19:13:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:06,237 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1453 transitions. [2025-03-16 19:13:06,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1453 transitions. [2025-03-16 19:13:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 19:13:06,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:06,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:06,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:13:06,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:06,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1477506307, now seen corresponding path program 1 times [2025-03-16 19:13:06,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:06,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977464195] [2025-03-16 19:13:06,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:06,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:06,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 19:13:06,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 19:13:06,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:06,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:06,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977464195] [2025-03-16 19:13:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977464195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:06,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674031497] [2025-03-16 19:13:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:06,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:06,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:06,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:06,544 INFO L87 Difference]: Start difference. First operand 812 states and 1453 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:06,668 INFO L93 Difference]: Finished difference Result 1354 states and 2417 transitions. [2025-03-16 19:13:06,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:06,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2025-03-16 19:13:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:06,674 INFO L225 Difference]: With dead ends: 1354 [2025-03-16 19:13:06,675 INFO L226 Difference]: Without dead ends: 1071 [2025-03-16 19:13:06,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:06,677 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 234 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:06,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 2393 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-16 19:13:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1067. [2025-03-16 19:13:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1066 states have (on average 1.7879924953095685) internal successors, (1906), 1066 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1906 transitions. [2025-03-16 19:13:06,720 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1906 transitions. Word has length 198 [2025-03-16 19:13:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:06,721 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1906 transitions. [2025-03-16 19:13:06,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1906 transitions. [2025-03-16 19:13:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 19:13:06,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:06,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:06,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:13:06,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:06,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1470377460, now seen corresponding path program 1 times [2025-03-16 19:13:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:06,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883399213] [2025-03-16 19:13:06,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:06,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:06,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 19:13:06,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 19:13:06,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:06,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:07,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883399213] [2025-03-16 19:13:07,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883399213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:07,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:07,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380365596] [2025-03-16 19:13:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:07,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:07,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:07,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:07,020 INFO L87 Difference]: Start difference. First operand 1067 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:07,145 INFO L93 Difference]: Finished difference Result 2095 states and 3732 transitions. [2025-03-16 19:13:07,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-03-16 19:13:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:07,152 INFO L225 Difference]: With dead ends: 2095 [2025-03-16 19:13:07,153 INFO L226 Difference]: Without dead ends: 1557 [2025-03-16 19:13:07,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:07,155 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 226 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:07,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 2394 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-03-16 19:13:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1551. [2025-03-16 19:13:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 1.7819354838709678) internal successors, (2762), 1550 states have internal predecessors, (2762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2762 transitions. [2025-03-16 19:13:07,198 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2762 transitions. Word has length 202 [2025-03-16 19:13:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:07,199 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2762 transitions. [2025-03-16 19:13:07,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2762 transitions. [2025-03-16 19:13:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 19:13:07,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:07,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:07,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:13:07,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:07,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash -126366933, now seen corresponding path program 1 times [2025-03-16 19:13:07,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:07,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759186283] [2025-03-16 19:13:07,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:07,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 19:13:07,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 19:13:07,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:07,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:07,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759186283] [2025-03-16 19:13:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759186283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:07,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:07,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785324751] [2025-03-16 19:13:07,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:07,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:07,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:07,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:07,469 INFO L87 Difference]: Start difference. First operand 1551 states and 2762 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:07,558 INFO L93 Difference]: Finished difference Result 3499 states and 6212 transitions. [2025-03-16 19:13:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:07,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-03-16 19:13:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:07,568 INFO L225 Difference]: With dead ends: 3499 [2025-03-16 19:13:07,568 INFO L226 Difference]: Without dead ends: 2477 [2025-03-16 19:13:07,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:07,572 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 218 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:07,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 2395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-03-16 19:13:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2467. [2025-03-16 19:13:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 1.7737226277372262) internal successors, (4374), 2466 states have internal predecessors, (4374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 4374 transitions. [2025-03-16 19:13:07,690 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 4374 transitions. Word has length 206 [2025-03-16 19:13:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:07,690 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 4374 transitions. [2025-03-16 19:13:07,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 4374 transitions. [2025-03-16 19:13:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 19:13:07,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:07,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:07,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:13:07,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:07,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash 657433250, now seen corresponding path program 1 times [2025-03-16 19:13:07,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:07,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626605792] [2025-03-16 19:13:07,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:07,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:07,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 19:13:07,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 19:13:07,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:07,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:07,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626605792] [2025-03-16 19:13:07,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626605792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:07,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:07,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719105044] [2025-03-16 19:13:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:07,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:07,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:07,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:07,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:07,883 INFO L87 Difference]: Start difference. First operand 2467 states and 4374 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:08,002 INFO L93 Difference]: Finished difference Result 6151 states and 10872 transitions. [2025-03-16 19:13:08,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 210 [2025-03-16 19:13:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:08,018 INFO L225 Difference]: With dead ends: 6151 [2025-03-16 19:13:08,018 INFO L226 Difference]: Without dead ends: 4213 [2025-03-16 19:13:08,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:08,023 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 210 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:08,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 2396 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2025-03-16 19:13:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4195. [2025-03-16 19:13:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4195 states, 4194 states have (on average 1.7639484978540771) internal successors, (7398), 4194 states have internal predecessors, (7398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 7398 transitions. [2025-03-16 19:13:08,168 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 7398 transitions. Word has length 210 [2025-03-16 19:13:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:08,168 INFO L471 AbstractCegarLoop]: Abstraction has 4195 states and 7398 transitions. [2025-03-16 19:13:08,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 7398 transitions. [2025-03-16 19:13:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-16 19:13:08,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:08,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:08,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:13:08,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:08,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:08,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1898017881, now seen corresponding path program 1 times [2025-03-16 19:13:08,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:08,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721376633] [2025-03-16 19:13:08,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:08,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 19:13:08,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 19:13:08,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:08,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:08,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721376633] [2025-03-16 19:13:08,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721376633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:08,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:08,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:13:08,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650511609] [2025-03-16 19:13:08,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:08,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:13:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:08,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:13:08,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:13:08,586 INFO L87 Difference]: Start difference. First operand 4195 states and 7398 transitions. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:09,241 INFO L93 Difference]: Finished difference Result 25207 states and 44640 transitions. [2025-03-16 19:13:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:13:09,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-03-16 19:13:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:09,310 INFO L225 Difference]: With dead ends: 25207 [2025-03-16 19:13:09,310 INFO L226 Difference]: Without dead ends: 21541 [2025-03-16 19:13:09,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:13:09,327 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 2652 mSDsluCounter, 10107 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 11340 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:09,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2652 Valid, 11340 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:13:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21541 states. [2025-03-16 19:13:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21541 to 7718. [2025-03-16 19:13:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7718 states, 7717 states have (on average 1.760787870934301) internal successors, (13588), 7717 states have internal predecessors, (13588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 13588 transitions. [2025-03-16 19:13:09,724 INFO L78 Accepts]: Start accepts. Automaton has 7718 states and 13588 transitions. Word has length 214 [2025-03-16 19:13:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:09,724 INFO L471 AbstractCegarLoop]: Abstraction has 7718 states and 13588 transitions. [2025-03-16 19:13:09,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 7718 states and 13588 transitions. [2025-03-16 19:13:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-16 19:13:09,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:09,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:09,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:13:09,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:09,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:09,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1289228208, now seen corresponding path program 1 times [2025-03-16 19:13:09,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:09,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175776716] [2025-03-16 19:13:09,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:09,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:09,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 19:13:09,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 19:13:09,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:09,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:09,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:09,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175776716] [2025-03-16 19:13:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175776716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:09,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818289342] [2025-03-16 19:13:09,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:09,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:09,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:09,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:09,994 INFO L87 Difference]: Start difference. First operand 7718 states and 13588 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:10,217 INFO L93 Difference]: Finished difference Result 22527 states and 39781 transitions. [2025-03-16 19:13:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:10,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-03-16 19:13:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:10,256 INFO L225 Difference]: With dead ends: 22527 [2025-03-16 19:13:10,256 INFO L226 Difference]: Without dead ends: 15338 [2025-03-16 19:13:10,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:13:10,271 INFO L435 NwaCegarLoop]: 1220 mSDtfsCounter, 775 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3844 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:10,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3844 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15338 states. [2025-03-16 19:13:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15338 to 11495. [2025-03-16 19:13:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11495 states, 11494 states have (on average 1.7609187402122846) internal successors, (20240), 11494 states have internal predecessors, (20240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11495 states to 11495 states and 20240 transitions. [2025-03-16 19:13:10,613 INFO L78 Accepts]: Start accepts. Automaton has 11495 states and 20240 transitions. Word has length 215 [2025-03-16 19:13:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:10,613 INFO L471 AbstractCegarLoop]: Abstraction has 11495 states and 20240 transitions. [2025-03-16 19:13:10,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 11495 states and 20240 transitions. [2025-03-16 19:13:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 19:13:10,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:10,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:10,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:13:10,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:10,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1309668741, now seen corresponding path program 1 times [2025-03-16 19:13:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:10,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398906468] [2025-03-16 19:13:10,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:10,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 19:13:10,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 19:13:10,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:10,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:10,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:10,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398906468] [2025-03-16 19:13:10,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398906468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:10,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:10,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:10,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834621740] [2025-03-16 19:13:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:10,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:10,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:10,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:10,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:10,811 INFO L87 Difference]: Start difference. First operand 11495 states and 20240 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:11,111 INFO L93 Difference]: Finished difference Result 33829 states and 59629 transitions. [2025-03-16 19:13:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2025-03-16 19:13:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:11,157 INFO L225 Difference]: With dead ends: 33829 [2025-03-16 19:13:11,157 INFO L226 Difference]: Without dead ends: 22863 [2025-03-16 19:13:11,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:13:11,176 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 775 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3834 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:11,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3834 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22863 states. [2025-03-16 19:13:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22863 to 17131. [2025-03-16 19:13:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17131 states, 17130 states have (on average 1.7573847051955633) internal successors, (30104), 17130 states have internal predecessors, (30104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17131 states to 17131 states and 30104 transitions. [2025-03-16 19:13:11,690 INFO L78 Accepts]: Start accepts. Automaton has 17131 states and 30104 transitions. Word has length 216 [2025-03-16 19:13:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:11,690 INFO L471 AbstractCegarLoop]: Abstraction has 17131 states and 30104 transitions. [2025-03-16 19:13:11,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 17131 states and 30104 transitions. [2025-03-16 19:13:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-16 19:13:11,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:11,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:11,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:13:11,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1943384846, now seen corresponding path program 1 times [2025-03-16 19:13:11,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:11,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516706407] [2025-03-16 19:13:11,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:11,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 19:13:11,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 19:13:11,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:11,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:11,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:11,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516706407] [2025-03-16 19:13:11,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516706407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:11,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:11,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362561747] [2025-03-16 19:13:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:11,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:11,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:11,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:11,969 INFO L87 Difference]: Start difference. First operand 17131 states and 30104 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:12,335 INFO L93 Difference]: Finished difference Result 50801 states and 89385 transitions. [2025-03-16 19:13:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:12,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-03-16 19:13:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:12,408 INFO L225 Difference]: With dead ends: 50801 [2025-03-16 19:13:12,409 INFO L226 Difference]: Without dead ends: 34199 [2025-03-16 19:13:12,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:13:12,440 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 773 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 3835 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:12,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 3835 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34199 states. [2025-03-16 19:13:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34199 to 25595. [2025-03-16 19:13:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25595 states, 25594 states have (on average 1.7540829882003595) internal successors, (44894), 25594 states have internal predecessors, (44894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25595 states to 25595 states and 44894 transitions. [2025-03-16 19:13:12,991 INFO L78 Accepts]: Start accepts. Automaton has 25595 states and 44894 transitions. Word has length 217 [2025-03-16 19:13:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:12,991 INFO L471 AbstractCegarLoop]: Abstraction has 25595 states and 44894 transitions. [2025-03-16 19:13:12,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 25595 states and 44894 transitions. [2025-03-16 19:13:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 19:13:12,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:12,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:13,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:13:13,000 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:13,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1814515202, now seen corresponding path program 1 times [2025-03-16 19:13:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:13,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389301083] [2025-03-16 19:13:13,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:13,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 19:13:13,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 19:13:13,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:13,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:13,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:13,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389301083] [2025-03-16 19:13:13,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389301083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:13,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:13,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871754700] [2025-03-16 19:13:13,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:13,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:13,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:13,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:13,128 INFO L87 Difference]: Start difference. First operand 25595 states and 44894 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:13,448 INFO L93 Difference]: Finished difference Result 57179 states and 100235 transitions. [2025-03-16 19:13:13,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:13,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-03-16 19:13:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:13,522 INFO L225 Difference]: With dead ends: 57179 [2025-03-16 19:13:13,522 INFO L226 Difference]: Without dead ends: 39757 [2025-03-16 19:13:13,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:13,542 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 233 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:13,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 2576 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39757 states. [2025-03-16 19:13:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39757 to 39755. [2025-03-16 19:13:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39755 states, 39754 states have (on average 1.746616692659858) internal successors, (69435), 39754 states have internal predecessors, (69435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39755 states to 39755 states and 69435 transitions. [2025-03-16 19:13:14,152 INFO L78 Accepts]: Start accepts. Automaton has 39755 states and 69435 transitions. Word has length 218 [2025-03-16 19:13:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:14,153 INFO L471 AbstractCegarLoop]: Abstraction has 39755 states and 69435 transitions. [2025-03-16 19:13:14,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39755 states and 69435 transitions. [2025-03-16 19:13:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 19:13:14,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:14,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:14,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:13:14,158 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:14,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:14,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1904963006, now seen corresponding path program 1 times [2025-03-16 19:13:14,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:14,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814934169] [2025-03-16 19:13:14,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:14,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:14,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 19:13:14,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 19:13:14,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:14,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814934169] [2025-03-16 19:13:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814934169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519933029] [2025-03-16 19:13:14,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:14,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:14,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:14,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:14,288 INFO L87 Difference]: Start difference. First operand 39755 states and 69435 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:14,902 INFO L93 Difference]: Finished difference Result 88857 states and 155109 transitions. [2025-03-16 19:13:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:14,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-03-16 19:13:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:15,013 INFO L225 Difference]: With dead ends: 88857 [2025-03-16 19:13:15,014 INFO L226 Difference]: Without dead ends: 61577 [2025-03-16 19:13:15,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:15,041 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 225 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:15,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 2557 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61577 states. [2025-03-16 19:13:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61577 to 61575. [2025-03-16 19:13:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61575 states, 61574 states have (on average 1.7383798356449152) internal successors, (107039), 61574 states have internal predecessors, (107039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61575 states to 61575 states and 107039 transitions. [2025-03-16 19:13:16,074 INFO L78 Accepts]: Start accepts. Automaton has 61575 states and 107039 transitions. Word has length 218 [2025-03-16 19:13:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 61575 states and 107039 transitions. [2025-03-16 19:13:16,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 61575 states and 107039 transitions. [2025-03-16 19:13:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 19:13:16,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:16,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:16,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:13:16,078 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:16,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash -459937410, now seen corresponding path program 1 times [2025-03-16 19:13:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:16,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419172512] [2025-03-16 19:13:16,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:16,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 19:13:16,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 19:13:16,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:16,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:16,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:16,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419172512] [2025-03-16 19:13:16,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419172512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:16,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:16,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:16,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345758700] [2025-03-16 19:13:16,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:16,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:16,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:16,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:16,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:16,194 INFO L87 Difference]: Start difference. First operand 61575 states and 107039 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:16,755 INFO L93 Difference]: Finished difference Result 120851 states and 210029 transitions. [2025-03-16 19:13:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-03-16 19:13:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:16,880 INFO L225 Difference]: With dead ends: 120851 [2025-03-16 19:13:16,880 INFO L226 Difference]: Without dead ends: 87635 [2025-03-16 19:13:16,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:16,919 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 217 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:16,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 2539 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87635 states. [2025-03-16 19:13:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87635 to 87633. [2025-03-16 19:13:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87633 states, 87632 states have (on average 1.7307490414460471) internal successors, (151669), 87632 states have internal predecessors, (151669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87633 states to 87633 states and 151669 transitions. [2025-03-16 19:13:18,286 INFO L78 Accepts]: Start accepts. Automaton has 87633 states and 151669 transitions. Word has length 218 [2025-03-16 19:13:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:18,286 INFO L471 AbstractCegarLoop]: Abstraction has 87633 states and 151669 transitions. [2025-03-16 19:13:18,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 87633 states and 151669 transitions. [2025-03-16 19:13:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 19:13:18,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:18,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:18,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:13:18,289 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:18,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1598544578, now seen corresponding path program 1 times [2025-03-16 19:13:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925466890] [2025-03-16 19:13:18,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:18,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 19:13:18,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 19:13:18,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:18,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:18,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:18,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925466890] [2025-03-16 19:13:18,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925466890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:18,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:18,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:18,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838298074] [2025-03-16 19:13:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:18,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:18,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:18,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:18,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:18,643 INFO L87 Difference]: Start difference. First operand 87633 states and 151669 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:19,467 INFO L93 Difference]: Finished difference Result 171269 states and 296359 transitions. [2025-03-16 19:13:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:19,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-03-16 19:13:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:19,634 INFO L225 Difference]: With dead ends: 171269 [2025-03-16 19:13:19,634 INFO L226 Difference]: Without dead ends: 124073 [2025-03-16 19:13:19,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:19,678 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 209 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:19,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 2520 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124073 states. [2025-03-16 19:13:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124073 to 124071. [2025-03-16 19:13:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124071 states, 124070 states have (on average 1.7224067058918353) internal successors, (213699), 124070 states have internal predecessors, (213699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124071 states to 124071 states and 213699 transitions. [2025-03-16 19:13:21,734 INFO L78 Accepts]: Start accepts. Automaton has 124071 states and 213699 transitions. Word has length 218 [2025-03-16 19:13:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:21,735 INFO L471 AbstractCegarLoop]: Abstraction has 124071 states and 213699 transitions. [2025-03-16 19:13:21,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 124071 states and 213699 transitions. [2025-03-16 19:13:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 19:13:21,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:21,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:21,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:13:21,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:21,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash -113807203, now seen corresponding path program 1 times [2025-03-16 19:13:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:21,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743646330] [2025-03-16 19:13:21,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:21,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 19:13:21,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 19:13:21,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:21,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743646330] [2025-03-16 19:13:21,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743646330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:21,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:21,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:21,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859036319] [2025-03-16 19:13:21,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:21,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:21,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:21,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:21,907 INFO L87 Difference]: Start difference. First operand 124071 states and 213699 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:24,153 INFO L93 Difference]: Finished difference Result 408285 states and 703692 transitions. [2025-03-16 19:13:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:24,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-03-16 19:13:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:24,621 INFO L225 Difference]: With dead ends: 408285 [2025-03-16 19:13:24,621 INFO L226 Difference]: Without dead ends: 284923 [2025-03-16 19:13:24,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:13:24,927 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 771 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 3837 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:24,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 3837 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:13:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284923 states. [2025-03-16 19:13:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284923 to 204063. [2025-03-16 19:13:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204063 states, 204062 states have (on average 1.7166694436004744) internal successors, (350307), 204062 states have internal predecessors, (350307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204063 states to 204063 states and 350307 transitions. [2025-03-16 19:13:28,829 INFO L78 Accepts]: Start accepts. Automaton has 204063 states and 350307 transitions. Word has length 218 [2025-03-16 19:13:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:28,830 INFO L471 AbstractCegarLoop]: Abstraction has 204063 states and 350307 transitions. [2025-03-16 19:13:28,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 204063 states and 350307 transitions. [2025-03-16 19:13:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 19:13:28,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:28,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:28,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:13:28,831 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:28,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1472050750, now seen corresponding path program 1 times [2025-03-16 19:13:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:28,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244582763] [2025-03-16 19:13:28,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:28,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:28,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 19:13:28,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 19:13:28,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:28,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:28,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:28,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244582763] [2025-03-16 19:13:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244582763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:28,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:28,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081461469] [2025-03-16 19:13:28,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:28,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:28,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:28,979 INFO L87 Difference]: Start difference. First operand 204063 states and 350307 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:31,876 INFO L93 Difference]: Finished difference Result 458154 states and 788533 transitions. [2025-03-16 19:13:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:31,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-03-16 19:13:31,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:32,418 INFO L225 Difference]: With dead ends: 458154 [2025-03-16 19:13:32,419 INFO L226 Difference]: Without dead ends: 313664 [2025-03-16 19:13:32,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:32,526 INFO L435 NwaCegarLoop]: 1430 mSDtfsCounter, 241 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:32,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 2612 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313664 states. [2025-03-16 19:13:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313664 to 313662. [2025-03-16 19:13:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313662 states, 313661 states have (on average 1.7090106835086287) internal successors, (536050), 313661 states have internal predecessors, (536050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313662 states to 313662 states and 536050 transitions. [2025-03-16 19:13:37,776 INFO L78 Accepts]: Start accepts. Automaton has 313662 states and 536050 transitions. Word has length 218 [2025-03-16 19:13:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:37,777 INFO L471 AbstractCegarLoop]: Abstraction has 313662 states and 536050 transitions. [2025-03-16 19:13:37,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 313662 states and 536050 transitions. [2025-03-16 19:13:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-16 19:13:37,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:37,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:37,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:13:37,783 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:37,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash 768465300, now seen corresponding path program 1 times [2025-03-16 19:13:37,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:37,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007965780] [2025-03-16 19:13:37,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:37,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:37,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-16 19:13:37,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-16 19:13:37,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:37,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007965780] [2025-03-16 19:13:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007965780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:38,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:38,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471786794] [2025-03-16 19:13:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:38,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:38,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:38,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:38,366 INFO L87 Difference]: Start difference. First operand 313662 states and 536050 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)