./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label39.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 ac1b1988d7562356ff82123079a37b8cde9200cfd597bb0905605a20cdbc8694 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:56:19,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:56:19,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:56:19,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:56:19,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:56:19,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:56:19,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:56:19,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:56:19,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:56:19,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:56:19,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:56:19,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:56:19,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:56:19,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:56:19,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:56:19,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:56:19,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:56:19,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:56:19,673 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 -> ac1b1988d7562356ff82123079a37b8cde9200cfd597bb0905605a20cdbc8694 [2025-03-16 14:56:19,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:56:19,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:56:19,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:56:19,887 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:56:19,887 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:56:19,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label39.c [2025-03-16 14:56:20,981 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edfab7950/8916bd7a75d64818b77bd8ee89bdf31e/FLAGa05b3b3cd [2025-03-16 14:56:21,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:56:21,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label39.c [2025-03-16 14:56:21,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edfab7950/8916bd7a75d64818b77bd8ee89bdf31e/FLAGa05b3b3cd [2025-03-16 14:56:21,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edfab7950/8916bd7a75d64818b77bd8ee89bdf31e [2025-03-16 14:56:21,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:56:21,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:56:21,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:56:21,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:56:21,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:56:21,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:56:21" (1/1) ... [2025-03-16 14:56:21,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5222362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:21, skipping insertion in model container [2025-03-16 14:56:21,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:56:21" (1/1) ... [2025-03-16 14:56:21,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:56:21,793 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label39.c[2950,2963] [2025-03-16 14:56:22,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:56:22,310 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:56:22,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label39.c[2950,2963] [2025-03-16 14:56:22,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:56:22,615 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:56:22,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22 WrapperNode [2025-03-16 14:56:22,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:56:22,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:56:22,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:56:22,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:56:22,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:22,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:22,935 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:56:22,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:56:22,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:56:22,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:56:22,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:56:22,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:22,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:23,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:23,161 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:56:23,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:23,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:23,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:23,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:23,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:23,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:23,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:56:23,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:56:23,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:56:23,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:56:23,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (1/1) ... [2025-03-16 14:56:23,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:56:23,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:23,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:56:23,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:56:23,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:56:23,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:56:23,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:56:23,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:56:23,469 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:56:23,470 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:56:26,667 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:56:26,669 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:56:26,669 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:56:26,829 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:56:26,829 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:56:26,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:56:26,863 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:56:26,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:56:26 BoogieIcfgContainer [2025-03-16 14:56:26,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:56:26,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:56:26,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:56:26,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:56:26,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:56:21" (1/3) ... [2025-03-16 14:56:26,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d2363e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:56:26, skipping insertion in model container [2025-03-16 14:56:26,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:22" (2/3) ... [2025-03-16 14:56:26,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d2363e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:56:26, skipping insertion in model container [2025-03-16 14:56:26,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:56:26" (3/3) ... [2025-03-16 14:56:26,874 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label39.c [2025-03-16 14:56:26,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:56:26,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label39.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:56:26,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:56:26,967 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;@7568501d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:56:26,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:56:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 14:56:26,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:26,979 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] [2025-03-16 14:56:26,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:26,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash 59030602, now seen corresponding path program 1 times [2025-03-16 14:56:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121727233] [2025-03-16 14:56:26,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:27,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 14:56:27,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 14:56:27,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:27,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:27,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:27,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121727233] [2025-03-16 14:56:27,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121727233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:27,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:27,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:56:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202380302] [2025-03-16 14:56:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:27,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:56:27,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:27,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:56:27,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:56:27,133 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:27,210 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:56:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:56:27,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-16 14:56:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:27,225 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:56:27,225 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:56:27,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:56:27,232 INFO L435 NwaCegarLoop]: 1441 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, 1441 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:27,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:56:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:56:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:56:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:56:27,301 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 20 [2025-03-16 14:56:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:27,301 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:56:27,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:56:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 14:56:27,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:27,302 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] [2025-03-16 14:56:27,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:56:27,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:27,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash 598457131, now seen corresponding path program 1 times [2025-03-16 14:56:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:27,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025946790] [2025-03-16 14:56:27,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:27,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:27,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 14:56:27,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 14:56:27,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:27,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:27,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:27,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025946790] [2025-03-16 14:56:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025946790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:27,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:27,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:56:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085635339] [2025-03-16 14:56:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:27,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:27,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:27,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:27,434 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:30,041 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2025-03-16 14:56:30,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:30,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-16 14:56:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:30,049 INFO L225 Difference]: With dead ends: 2258 [2025-03-16 14:56:30,050 INFO L226 Difference]: Without dead ends: 1505 [2025-03-16 14:56:30,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:30,053 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 797 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:30,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 427 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 14:56:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-16 14:56:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-03-16 14:56:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2025-03-16 14:56:30,081 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 20 [2025-03-16 14:56:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:30,081 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2025-03-16 14:56:30,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2025-03-16 14:56:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 14:56:30,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:30,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:30,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:56:30,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:30,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 724961307, now seen corresponding path program 1 times [2025-03-16 14:56:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:30,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737620289] [2025-03-16 14:56:30,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:30,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 14:56:30,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 14:56:30,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:30,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737620289] [2025-03-16 14:56:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737620289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:56:30,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656491414] [2025-03-16 14:56:30,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:30,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:30,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:30,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:56:30,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:56:30,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 14:56:30,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 14:56:30,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:30,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:30,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:56:30,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:56:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:30,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:56:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656491414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:30,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:56:30,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:56:30,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777408739] [2025-03-16 14:56:30,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:30,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:30,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:30,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:30,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:56:30,553 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:33,187 INFO L93 Difference]: Finished difference Result 4511 states and 7392 transitions. [2025-03-16 14:56:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 14:56:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:33,197 INFO L225 Difference]: With dead ends: 4511 [2025-03-16 14:56:33,197 INFO L226 Difference]: Without dead ends: 3007 [2025-03-16 14:56:33,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:56:33,201 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 778 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:33,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 474 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:56:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2025-03-16 14:56:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2025-03-16 14:56:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.425482368596141) internal successors, (4285), 3006 states have internal predecessors, (4285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4285 transitions. [2025-03-16 14:56:33,250 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4285 transitions. Word has length 91 [2025-03-16 14:56:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:33,250 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4285 transitions. [2025-03-16 14:56:33,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4285 transitions. [2025-03-16 14:56:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 14:56:33,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:33,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:33,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:56:33,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:33,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:33,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:33,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1469947035, now seen corresponding path program 1 times [2025-03-16 14:56:33,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:33,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971716019] [2025-03-16 14:56:33,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:33,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 14:56:33,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 14:56:33,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:33,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:33,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:33,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971716019] [2025-03-16 14:56:33,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971716019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:56:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908158277] [2025-03-16 14:56:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:33,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:33,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:33,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:33,589 INFO L87 Difference]: Start difference. First operand 3007 states and 4285 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:35,902 INFO L93 Difference]: Finished difference Result 9019 states and 12853 transitions. [2025-03-16 14:56:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-16 14:56:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:35,918 INFO L225 Difference]: With dead ends: 9019 [2025-03-16 14:56:35,918 INFO L226 Difference]: Without dead ends: 6013 [2025-03-16 14:56:35,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:35,922 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:35,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 582 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2025-03-16 14:56:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 6011. [2025-03-16 14:56:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 1.328785357737105) internal successors, (7986), 6010 states have internal predecessors, (7986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 7986 transitions. [2025-03-16 14:56:35,997 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 7986 transitions. Word has length 95 [2025-03-16 14:56:35,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:35,998 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 7986 transitions. [2025-03-16 14:56:35,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:35,998 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 7986 transitions. [2025-03-16 14:56:35,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 14:56:35,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:36,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:36,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:56:36,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:36,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:36,004 INFO L85 PathProgramCache]: Analyzing trace with hash 871340378, now seen corresponding path program 1 times [2025-03-16 14:56:36,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:36,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582290922] [2025-03-16 14:56:36,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:36,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:36,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 14:56:36,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 14:56:36,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:36,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:36,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:36,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582290922] [2025-03-16 14:56:36,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582290922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:36,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:36,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:36,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288012812] [2025-03-16 14:56:36,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:36,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:56:36,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:36,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:56:36,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:56:36,260 INFO L87 Difference]: Start difference. First operand 6011 states and 7986 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:39,766 INFO L93 Difference]: Finished difference Result 18780 states and 24766 transitions. [2025-03-16 14:56:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:56:39,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-16 14:56:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:39,796 INFO L225 Difference]: With dead ends: 18780 [2025-03-16 14:56:39,796 INFO L226 Difference]: Without dead ends: 12770 [2025-03-16 14:56:39,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:39,804 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 2103 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4868 mSolverCounterSat, 689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 5557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 4868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:39,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2103 Valid, 264 Invalid, 5557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [689 Valid, 4868 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 14:56:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2025-03-16 14:56:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 12770. [2025-03-16 14:56:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12770 states, 12769 states have (on average 1.292113712898426) internal successors, (16499), 12769 states have internal predecessors, (16499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12770 states to 12770 states and 16499 transitions. [2025-03-16 14:56:39,969 INFO L78 Accepts]: Start accepts. Automaton has 12770 states and 16499 transitions. Word has length 129 [2025-03-16 14:56:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:39,971 INFO L471 AbstractCegarLoop]: Abstraction has 12770 states and 16499 transitions. [2025-03-16 14:56:39,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 12770 states and 16499 transitions. [2025-03-16 14:56:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 14:56:39,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:39,973 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:39,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:56:39,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:39,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash 846533226, now seen corresponding path program 1 times [2025-03-16 14:56:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522940422] [2025-03-16 14:56:39,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:40,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 14:56:40,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 14:56:40,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:40,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:40,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:40,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522940422] [2025-03-16 14:56:40,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522940422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:40,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:40,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:40,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311186224] [2025-03-16 14:56:40,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:40,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:56:40,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:40,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:56:40,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:56:40,261 INFO L87 Difference]: Start difference. First operand 12770 states and 16499 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:42,478 INFO L93 Difference]: Finished difference Result 27829 states and 35623 transitions. [2025-03-16 14:56:42,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:56:42,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2025-03-16 14:56:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:42,512 INFO L225 Difference]: With dead ends: 27829 [2025-03-16 14:56:42,512 INFO L226 Difference]: Without dead ends: 15774 [2025-03-16 14:56:42,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:56:42,522 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 702 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:42,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 706 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:56:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15774 states. [2025-03-16 14:56:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15774 to 15774. [2025-03-16 14:56:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.2428200088759271) internal successors, (19603), 15773 states have internal predecessors, (19603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 19603 transitions. [2025-03-16 14:56:42,708 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 19603 transitions. Word has length 200 [2025-03-16 14:56:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:42,708 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 19603 transitions. [2025-03-16 14:56:42,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 19603 transitions. [2025-03-16 14:56:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-16 14:56:42,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:42,710 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:42,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:56:42,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:42,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash -46524701, now seen corresponding path program 1 times [2025-03-16 14:56:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83610651] [2025-03-16 14:56:42,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:42,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-16 14:56:42,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-16 14:56:42,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:42,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-16 14:56:43,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83610651] [2025-03-16 14:56:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83610651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:43,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:43,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:56:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926942109] [2025-03-16 14:56:43,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:43,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:43,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:43,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:43,073 INFO L87 Difference]: Start difference. First operand 15774 states and 19603 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:45,141 INFO L93 Difference]: Finished difference Result 43563 states and 54854 transitions. [2025-03-16 14:56:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:45,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2025-03-16 14:56:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:45,193 INFO L225 Difference]: With dead ends: 43563 [2025-03-16 14:56:45,193 INFO L226 Difference]: Without dead ends: 28541 [2025-03-16 14:56:45,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:45,209 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 696 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:45,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 427 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:56:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28541 states. [2025-03-16 14:56:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28541 to 25537. [2025-03-16 14:56:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25537 states, 25536 states have (on average 1.1881657268170427) internal successors, (30341), 25536 states have internal predecessors, (30341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25537 states to 25537 states and 30341 transitions. [2025-03-16 14:56:45,521 INFO L78 Accepts]: Start accepts. Automaton has 25537 states and 30341 transitions. Word has length 235 [2025-03-16 14:56:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:45,521 INFO L471 AbstractCegarLoop]: Abstraction has 25537 states and 30341 transitions. [2025-03-16 14:56:45,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 25537 states and 30341 transitions. [2025-03-16 14:56:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 14:56:45,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:45,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:45,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:56:45,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:45,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -480110219, now seen corresponding path program 1 times [2025-03-16 14:56:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:45,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895737629] [2025-03-16 14:56:45,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:45,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 14:56:45,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 14:56:45,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:45,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:56:45,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895737629] [2025-03-16 14:56:45,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895737629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:45,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:45,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051253554] [2025-03-16 14:56:45,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:45,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:45,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:45,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:45,828 INFO L87 Difference]: Start difference. First operand 25537 states and 30341 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:48,217 INFO L93 Difference]: Finished difference Result 63840 states and 77141 transitions. [2025-03-16 14:56:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 250 [2025-03-16 14:56:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:48,264 INFO L225 Difference]: With dead ends: 63840 [2025-03-16 14:56:48,264 INFO L226 Difference]: Without dead ends: 39055 [2025-03-16 14:56:48,282 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 14:56:48,283 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 754 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:48,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1214 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39055 states. [2025-03-16 14:56:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39055 to 35300. [2025-03-16 14:56:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35300 states, 35299 states have (on average 1.1645655684297005) internal successors, (41108), 35299 states have internal predecessors, (41108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35300 states to 35300 states and 41108 transitions. [2025-03-16 14:56:48,633 INFO L78 Accepts]: Start accepts. Automaton has 35300 states and 41108 transitions. Word has length 250 [2025-03-16 14:56:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:48,633 INFO L471 AbstractCegarLoop]: Abstraction has 35300 states and 41108 transitions. [2025-03-16 14:56:48,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 35300 states and 41108 transitions. [2025-03-16 14:56:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-16 14:56:48,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:48,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:48,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:56:48,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:48,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1400283343, now seen corresponding path program 1 times [2025-03-16 14:56:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:48,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315324021] [2025-03-16 14:56:48,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:48,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:48,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-16 14:56:48,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-16 14:56:48,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:48,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:48,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:48,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315324021] [2025-03-16 14:56:48,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315324021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448296806] [2025-03-16 14:56:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:48,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:48,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:48,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:48,905 INFO L87 Difference]: Start difference. First operand 35300 states and 41108 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:51,464 INFO L93 Difference]: Finished difference Result 90876 states and 105361 transitions. [2025-03-16 14:56:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:51,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2025-03-16 14:56:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:51,529 INFO L225 Difference]: With dead ends: 90876 [2025-03-16 14:56:51,529 INFO L226 Difference]: Without dead ends: 56328 [2025-03-16 14:56:51,545 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 14:56:51,546 INFO L435 NwaCegarLoop]: 1228 mSDtfsCounter, 635 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:51,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1235 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:56:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56328 states. [2025-03-16 14:56:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56328 to 53324. [2025-03-16 14:56:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53324 states, 53323 states have (on average 1.149747763629203) internal successors, (61308), 53323 states have internal predecessors, (61308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53324 states to 53324 states and 61308 transitions. [2025-03-16 14:56:52,178 INFO L78 Accepts]: Start accepts. Automaton has 53324 states and 61308 transitions. Word has length 278 [2025-03-16 14:56:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:52,179 INFO L471 AbstractCegarLoop]: Abstraction has 53324 states and 61308 transitions. [2025-03-16 14:56:52,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 53324 states and 61308 transitions. [2025-03-16 14:56:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-16 14:56:52,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:52,182 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:52,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:56:52,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:52,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:52,183 INFO L85 PathProgramCache]: Analyzing trace with hash -473339374, now seen corresponding path program 1 times [2025-03-16 14:56:52,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:52,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074249254] [2025-03-16 14:56:52,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:52,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-16 14:56:52,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-16 14:56:52,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:52,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-16 14:56:52,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:52,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074249254] [2025-03-16 14:56:52,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074249254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:52,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:52,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:52,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156803805] [2025-03-16 14:56:52,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:52,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:52,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:52,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:52,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:52,751 INFO L87 Difference]: Start difference. First operand 53324 states and 61308 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:54,907 INFO L93 Difference]: Finished difference Result 117912 states and 135113 transitions. [2025-03-16 14:56:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:54,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 305 [2025-03-16 14:56:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:55,050 INFO L225 Difference]: With dead ends: 117912 [2025-03-16 14:56:55,050 INFO L226 Difference]: Without dead ends: 65340 [2025-03-16 14:56:55,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:55,074 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 850 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:55,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 904 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:56:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65340 states. [2025-03-16 14:56:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65340 to 60834. [2025-03-16 14:56:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60834 states, 60833 states have (on average 1.1255239754738382) internal successors, (68469), 60833 states have internal predecessors, (68469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60834 states to 60834 states and 68469 transitions. [2025-03-16 14:56:55,589 INFO L78 Accepts]: Start accepts. Automaton has 60834 states and 68469 transitions. Word has length 305 [2025-03-16 14:56:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:55,589 INFO L471 AbstractCegarLoop]: Abstraction has 60834 states and 68469 transitions. [2025-03-16 14:56:55,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 60834 states and 68469 transitions. [2025-03-16 14:56:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-16 14:56:55,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:55,595 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:55,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:56:55,596 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:55,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:55,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1458560309, now seen corresponding path program 1 times [2025-03-16 14:56:55,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:55,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095767997] [2025-03-16 14:56:55,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:55,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:55,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-16 14:56:55,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-16 14:56:55,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:55,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-16 14:56:56,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095767997] [2025-03-16 14:56:56,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095767997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:56,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:56,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315418080] [2025-03-16 14:56:56,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:56,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:56,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:56,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:56,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:56,017 INFO L87 Difference]: Start difference. First operand 60834 states and 68469 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 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 14:56:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:58,560 INFO L93 Difference]: Finished difference Result 126924 states and 142452 transitions. [2025-03-16 14:56:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:58,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 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 434 [2025-03-16 14:56:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:58,638 INFO L225 Difference]: With dead ends: 126924 [2025-03-16 14:56:58,639 INFO L226 Difference]: Without dead ends: 66842 [2025-03-16 14:56:58,683 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 14:56:58,684 INFO L435 NwaCegarLoop]: 1247 mSDtfsCounter, 765 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:58,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1254 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66842 states. [2025-03-16 14:56:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66842 to 64589. [2025-03-16 14:56:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64589 states, 64588 states have (on average 1.1085650585248035) internal successors, (71600), 64588 states have internal predecessors, (71600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64589 states to 64589 states and 71600 transitions. [2025-03-16 14:56:59,430 INFO L78 Accepts]: Start accepts. Automaton has 64589 states and 71600 transitions. Word has length 434 [2025-03-16 14:56:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:59,430 INFO L471 AbstractCegarLoop]: Abstraction has 64589 states and 71600 transitions. [2025-03-16 14:56:59,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 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 14:56:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 64589 states and 71600 transitions. [2025-03-16 14:56:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-16 14:56:59,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:59,442 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:59,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:56:59,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:59,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:59,443 INFO L85 PathProgramCache]: Analyzing trace with hash -91198452, now seen corresponding path program 1 times [2025-03-16 14:56:59,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:59,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629558110] [2025-03-16 14:56:59,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:59,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:59,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-16 14:56:59,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-16 14:56:59,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:59,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-16 14:56:59,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:59,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629558110] [2025-03-16 14:56:59,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629558110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:59,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:59,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531252659] [2025-03-16 14:56:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:59,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:59,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:59,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:59,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:59,638 INFO L87 Difference]: Start difference. First operand 64589 states and 71600 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:01,943 INFO L93 Difference]: Finished difference Result 132181 states and 146305 transitions. [2025-03-16 14:57:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:01,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 520 [2025-03-16 14:57:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:02,014 INFO L225 Difference]: With dead ends: 132181 [2025-03-16 14:57:02,014 INFO L226 Difference]: Without dead ends: 68344 [2025-03-16 14:57:02,053 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 14:57:02,054 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 662 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 617 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 617 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:02,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 287 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [617 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:57:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68344 states. [2025-03-16 14:57:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68344 to 60834. [2025-03-16 14:57:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60834 states, 60833 states have (on average 1.1068663389936384) internal successors, (67334), 60833 states have internal predecessors, (67334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60834 states to 60834 states and 67334 transitions. [2025-03-16 14:57:02,682 INFO L78 Accepts]: Start accepts. Automaton has 60834 states and 67334 transitions. Word has length 520 [2025-03-16 14:57:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:02,683 INFO L471 AbstractCegarLoop]: Abstraction has 60834 states and 67334 transitions. [2025-03-16 14:57:02,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 60834 states and 67334 transitions. [2025-03-16 14:57:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-16 14:57:02,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:02,694 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:02,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:57:02,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:02,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1071247876, now seen corresponding path program 1 times [2025-03-16 14:57:02,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:02,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271954230] [2025-03-16 14:57:02,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:02,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-16 14:57:02,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-16 14:57:02,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:02,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-16 14:57:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271954230] [2025-03-16 14:57:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271954230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336332702] [2025-03-16 14:57:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:02,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:02,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:02,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:02,965 INFO L87 Difference]: Start difference. First operand 60834 states and 67334 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:05,684 INFO L93 Difference]: Finished difference Result 140442 states and 157175 transitions. [2025-03-16 14:57:05,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:05,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 528 [2025-03-16 14:57:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:05,778 INFO L225 Difference]: With dead ends: 140442 [2025-03-16 14:57:05,778 INFO L226 Difference]: Without dead ends: 80360 [2025-03-16 14:57:05,821 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 14:57:05,821 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 756 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:05,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1361 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:57:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80360 states. [2025-03-16 14:57:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80360 to 78107. [2025-03-16 14:57:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78107 states, 78106 states have (on average 1.1021816505774205) internal successors, (86087), 78106 states have internal predecessors, (86087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78107 states to 78107 states and 86087 transitions. [2025-03-16 14:57:06,642 INFO L78 Accepts]: Start accepts. Automaton has 78107 states and 86087 transitions. Word has length 528 [2025-03-16 14:57:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:06,643 INFO L471 AbstractCegarLoop]: Abstraction has 78107 states and 86087 transitions. [2025-03-16 14:57:06,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 78107 states and 86087 transitions. [2025-03-16 14:57:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-16 14:57:06,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:06,653 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:06,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:57:06,653 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:06,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash -358272377, now seen corresponding path program 1 times [2025-03-16 14:57:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:06,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104660872] [2025-03-16 14:57:06,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:06,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-16 14:57:06,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-16 14:57:06,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:06,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 446 proven. 230 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-16 14:57:07,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:07,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104660872] [2025-03-16 14:57:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104660872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:57:07,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574651133] [2025-03-16 14:57:07,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:07,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:57:07,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:57:07,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:57:07,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:57:07,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-16 14:57:07,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-16 14:57:07,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:07,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:07,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:57:07,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:57:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-16 14:57:07,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:57:07,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574651133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:07,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:57:07,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:57:07,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909499468] [2025-03-16 14:57:07,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:07,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:07,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:07,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:07,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:57:07,488 INFO L87 Difference]: Start difference. First operand 78107 states and 86087 transitions. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:09,948 INFO L93 Difference]: Finished difference Result 169731 states and 188862 transitions. [2025-03-16 14:57:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 531 [2025-03-16 14:57:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:10,055 INFO L225 Difference]: With dead ends: 169731 [2025-03-16 14:57:10,055 INFO L226 Difference]: Without dead ends: 92376 [2025-03-16 14:57:10,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:57:10,108 INFO L435 NwaCegarLoop]: 1007 mSDtfsCounter, 661 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 716 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 716 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:10,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1013 Invalid, 3031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [716 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:57:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92376 states. [2025-03-16 14:57:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92376 to 92376. [2025-03-16 14:57:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92376 states, 92375 states have (on average 1.1152584573748308) internal successors, (103022), 92375 states have internal predecessors, (103022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92376 states to 92376 states and 103022 transitions. [2025-03-16 14:57:11,086 INFO L78 Accepts]: Start accepts. Automaton has 92376 states and 103022 transitions. Word has length 531 [2025-03-16 14:57:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:11,086 INFO L471 AbstractCegarLoop]: Abstraction has 92376 states and 103022 transitions. [2025-03-16 14:57:11,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 92376 states and 103022 transitions. [2025-03-16 14:57:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-16 14:57:11,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:11,100 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:11,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:57:11,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 14:57:11,300 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:11,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash -138812418, now seen corresponding path program 1 times [2025-03-16 14:57:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287648284] [2025-03-16 14:57:11,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:11,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-16 14:57:11,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-16 14:57:11,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:11,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-16 14:57:11,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:11,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287648284] [2025-03-16 14:57:11,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287648284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:11,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:11,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:11,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541319658] [2025-03-16 14:57:11,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:11,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:11,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:11,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:11,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:11,565 INFO L87 Difference]: Start difference. First operand 92376 states and 103022 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:13,809 INFO L93 Difference]: Finished difference Result 187755 states and 209075 transitions. [2025-03-16 14:57:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:13,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 540 [2025-03-16 14:57:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:13,920 INFO L225 Difference]: With dead ends: 187755 [2025-03-16 14:57:13,920 INFO L226 Difference]: Without dead ends: 96131 [2025-03-16 14:57:13,975 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 14:57:13,975 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 761 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:13,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 998 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:57:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96131 states. [2025-03-16 14:57:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96131 to 88621. [2025-03-16 14:57:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88621 states, 88620 states have (on average 1.0939742721733243) internal successors, (96948), 88620 states have internal predecessors, (96948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88621 states to 88621 states and 96948 transitions. [2025-03-16 14:57:14,832 INFO L78 Accepts]: Start accepts. Automaton has 88621 states and 96948 transitions. Word has length 540 [2025-03-16 14:57:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:14,832 INFO L471 AbstractCegarLoop]: Abstraction has 88621 states and 96948 transitions. [2025-03-16 14:57:14,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 88621 states and 96948 transitions. [2025-03-16 14:57:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-16 14:57:14,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:14,842 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:14,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:57:14,843 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:14,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash -442598145, now seen corresponding path program 1 times [2025-03-16 14:57:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:14,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097794170] [2025-03-16 14:57:14,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:14,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:14,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-16 14:57:15,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-16 14:57:15,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:15,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-16 14:57:15,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097794170] [2025-03-16 14:57:15,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097794170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:15,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:15,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:15,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582517813] [2025-03-16 14:57:15,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:15,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:15,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:15,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:15,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:15,223 INFO L87 Difference]: Start difference. First operand 88621 states and 96948 transitions. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:17,591 INFO L93 Difference]: Finished difference Result 213289 states and 233994 transitions. [2025-03-16 14:57:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:17,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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 566 [2025-03-16 14:57:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:17,732 INFO L225 Difference]: With dead ends: 213289 [2025-03-16 14:57:17,733 INFO L226 Difference]: Without dead ends: 125420 [2025-03-16 14:57:17,785 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 14:57:17,785 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 696 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:17,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1231 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:57:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125420 states. [2025-03-16 14:57:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125420 to 118661. [2025-03-16 14:57:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118661 states, 118660 states have (on average 1.0870385976740267) internal successors, (128988), 118660 states have internal predecessors, (128988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118661 states to 118661 states and 128988 transitions. [2025-03-16 14:57:19,112 INFO L78 Accepts]: Start accepts. Automaton has 118661 states and 128988 transitions. Word has length 566 [2025-03-16 14:57:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:19,112 INFO L471 AbstractCegarLoop]: Abstraction has 118661 states and 128988 transitions. [2025-03-16 14:57:19,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 118661 states and 128988 transitions. [2025-03-16 14:57:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-16 14:57:19,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:19,134 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:19,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:57:19,134 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:19,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:19,135 INFO L85 PathProgramCache]: Analyzing trace with hash -183942235, now seen corresponding path program 1 times [2025-03-16 14:57:19,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:19,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11926596] [2025-03-16 14:57:19,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:19,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-16 14:57:19,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-16 14:57:19,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:19,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2025-03-16 14:57:19,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11926596] [2025-03-16 14:57:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11926596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:19,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:19,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740436600] [2025-03-16 14:57:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:19,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:19,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:19,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:19,520 INFO L87 Difference]: Start difference. First operand 118661 states and 128988 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:21,926 INFO L93 Difference]: Finished difference Result 241076 states and 261771 transitions. [2025-03-16 14:57:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:21,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 649 [2025-03-16 14:57:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:22,079 INFO L225 Difference]: With dead ends: 241076 [2025-03-16 14:57:22,079 INFO L226 Difference]: Without dead ends: 119412 [2025-03-16 14:57:22,155 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 14:57:22,155 INFO L435 NwaCegarLoop]: 1228 mSDtfsCounter, 682 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:22,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1235 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:57:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119412 states. [2025-03-16 14:57:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119412 to 111151. [2025-03-16 14:57:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111151 states, 111150 states have (on average 1.066306792622582) internal successors, (118520), 111150 states have internal predecessors, (118520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111151 states to 111151 states and 118520 transitions. [2025-03-16 14:57:23,509 INFO L78 Accepts]: Start accepts. Automaton has 111151 states and 118520 transitions. Word has length 649 [2025-03-16 14:57:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:23,510 INFO L471 AbstractCegarLoop]: Abstraction has 111151 states and 118520 transitions. [2025-03-16 14:57:23,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 111151 states and 118520 transitions. [2025-03-16 14:57:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-03-16 14:57:23,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:23,534 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:23,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:57:23,535 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:23,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:23,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1234256622, now seen corresponding path program 1 times [2025-03-16 14:57:23,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:23,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357828768] [2025-03-16 14:57:23,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:23,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:23,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-16 14:57:23,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-16 14:57:23,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:23,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 377 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:25,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357828768] [2025-03-16 14:57:25,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357828768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:57:25,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59287267] [2025-03-16 14:57:25,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:25,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:57:25,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:57:25,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:57:25,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:57:25,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-16 14:57:25,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-16 14:57:25,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:25,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:25,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:57:25,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:57:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-16 14:57:26,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:57:26,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59287267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:26,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:57:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 14:57:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097618173] [2025-03-16 14:57:26,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:26,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:57:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:26,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:57:26,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:57:26,009 INFO L87 Difference]: Start difference. First operand 111151 states and 118520 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:30,039 INFO L93 Difference]: Finished difference Result 331949 states and 354697 transitions. [2025-03-16 14:57:30,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:57:30,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 725 [2025-03-16 14:57:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:30,284 INFO L225 Difference]: With dead ends: 331949 [2025-03-16 14:57:30,284 INFO L226 Difference]: Without dead ends: 221550 [2025-03-16 14:57:30,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:57:30,345 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1570 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4701 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 4701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:30,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 28 Invalid, 5284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 4701 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-16 14:57:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221550 states. [2025-03-16 14:57:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221550 to 219295. [2025-03-16 14:57:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219295 states, 219294 states have (on average 1.0658978357821007) internal successors, (233745), 219294 states have internal predecessors, (233745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219295 states to 219295 states and 233745 transitions. [2025-03-16 14:57:32,297 INFO L78 Accepts]: Start accepts. Automaton has 219295 states and 233745 transitions. Word has length 725 [2025-03-16 14:57:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:32,298 INFO L471 AbstractCegarLoop]: Abstraction has 219295 states and 233745 transitions. [2025-03-16 14:57:32,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 219295 states and 233745 transitions. [2025-03-16 14:57:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2025-03-16 14:57:32,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:32,325 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:32,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:57:32,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 14:57:32,525 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:32,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash 55666393, now seen corresponding path program 1 times [2025-03-16 14:57:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:32,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807489717] [2025-03-16 14:57:32,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:32,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 751 statements into 1 equivalence classes. [2025-03-16 14:57:32,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 751 of 751 statements. [2025-03-16 14:57:32,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:32,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2025-03-16 14:57:32,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807489717] [2025-03-16 14:57:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807489717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:32,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:32,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530862037] [2025-03-16 14:57:32,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:32,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:32,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:32,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:32,777 INFO L87 Difference]: Start difference. First operand 219295 states and 233745 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:36,070 INFO L93 Difference]: Finished difference Result 422818 states and 451012 transitions. [2025-03-16 14:57:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:36,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 751 [2025-03-16 14:57:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:36,344 INFO L225 Difference]: With dead ends: 422818 [2025-03-16 14:57:36,344 INFO L226 Difference]: Without dead ends: 236568 [2025-03-16 14:57:36,373 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 14:57:36,374 INFO L435 NwaCegarLoop]: 1110 mSDtfsCounter, 851 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:36,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1117 Invalid, 2594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2183 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:57:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236568 states. [2025-03-16 14:57:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236568 to 196014. [2025-03-16 14:57:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196014 states, 196013 states have (on average 1.0679801849877304) internal successors, (209338), 196013 states have internal predecessors, (209338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196014 states to 196014 states and 209338 transitions. [2025-03-16 14:57:39,240 INFO L78 Accepts]: Start accepts. Automaton has 196014 states and 209338 transitions. Word has length 751 [2025-03-16 14:57:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:39,240 INFO L471 AbstractCegarLoop]: Abstraction has 196014 states and 209338 transitions. [2025-03-16 14:57:39,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 196014 states and 209338 transitions. [2025-03-16 14:57:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2025-03-16 14:57:39,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:39,393 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:39,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:57:39,393 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:39,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:39,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1796297054, now seen corresponding path program 1 times [2025-03-16 14:57:39,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:39,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524624754] [2025-03-16 14:57:39,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:39,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:39,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 868 statements into 1 equivalence classes. [2025-03-16 14:57:39,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 868 of 868 statements. [2025-03-16 14:57:39,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:39,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 811 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:41,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:41,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524624754] [2025-03-16 14:57:41,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524624754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:57:41,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244916462] [2025-03-16 14:57:41,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:41,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:57:41,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:57:41,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:57:41,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:57:41,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 868 statements into 1 equivalence classes. [2025-03-16 14:57:41,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 868 of 868 statements. [2025-03-16 14:57:41,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:41,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:41,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 14:57:41,814 INFO L279 TraceCheckSpWp]: Computing forward predicates...