./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/Problem13_label20.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 c33ca3c6d8158368e2a1c112df44a3cf58b94be2237d2503e259747e7fb3b47e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:42:00,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:42:00,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:42:00,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:42:00,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:42:00,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:42:00,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:42:00,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:42:00,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:42:00,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:42:00,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:42:00,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:42:00,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:42:00,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:42:00,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:42:00,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:42:00,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:42:00,870 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:42:00,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:42:00,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:42:00,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:42:00,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:42:00,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:42:00,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:42:00,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:42:00,872 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:42:00,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:42:00,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:42:00,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:42:00,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:42:00,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:42:00,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:42:00,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:42:00,873 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 -> c33ca3c6d8158368e2a1c112df44a3cf58b94be2237d2503e259747e7fb3b47e [2025-03-03 10:42:01,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:42:01,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:42:01,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:42:01,094 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:42:01,094 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:42:01,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label20.c [2025-03-03 10:42:02,255 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed8ae52d/514ca241c8d645aa9160b36624eb7cca/FLAG6f2173b72 [2025-03-03 10:42:02,695 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:42:02,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label20.c [2025-03-03 10:42:02,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed8ae52d/514ca241c8d645aa9160b36624eb7cca/FLAG6f2173b72 [2025-03-03 10:42:02,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed8ae52d/514ca241c8d645aa9160b36624eb7cca [2025-03-03 10:42:02,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:42:02,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:42:02,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:42:02,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:42:02,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:42:02,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:42:02" (1/1) ... [2025-03-03 10:42:02,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ff2de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:02, skipping insertion in model container [2025-03-03 10:42:02,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:42:02" (1/1) ... [2025-03-03 10:42:02,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:42:03,104 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/Problem13_label20.c[7839,7852] [2025-03-03 10:42:03,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:42:03,592 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:42:03,610 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/Problem13_label20.c[7839,7852] [2025-03-03 10:42:03,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:42:03,943 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:42:03,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03 WrapperNode [2025-03-03 10:42:03,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:42:03,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:42:03,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:42:03,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:42:03,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:03,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,331 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:42:04,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:42:04,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:42:04,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:42:04,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:42:04,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,625 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-03 10:42:04,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,749 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:42:04,868 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:42:04,868 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:42:04,868 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:42:04,869 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (1/1) ... [2025-03-03 10:42:04,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:42:04,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:04,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:42:04,900 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-03 10:42:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:42:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:42:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:42:04,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:42:04,971 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:42:04,973 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:42:09,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:42:09,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:42:09,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:42:09,282 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:42:09,282 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:42:09,324 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:42:09,325 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:42:09,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:42:09 BoogieIcfgContainer [2025-03-03 10:42:09,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:42:09,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:42:09,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:42:09,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:42:09,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:42:02" (1/3) ... [2025-03-03 10:42:09,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba1695f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:42:09, skipping insertion in model container [2025-03-03 10:42:09,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:03" (2/3) ... [2025-03-03 10:42:09,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba1695f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:42:09, skipping insertion in model container [2025-03-03 10:42:09,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:42:09" (3/3) ... [2025-03-03 10:42:09,335 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label20.c [2025-03-03 10:42:09,349 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:42:09,351 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label20.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:42:09,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:42:09,433 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;@656b3e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:42:09,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:42:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 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-03 10:42:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 10:42:09,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:09,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:09,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:09,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash 955846273, now seen corresponding path program 1 times [2025-03-03 10:42:09,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:09,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76678421] [2025-03-03 10:42:09,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:09,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 10:42:09,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 10:42:09,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:09,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:09,772 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-03 10:42:09,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:09,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76678421] [2025-03-03 10:42:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76678421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:09,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790828114] [2025-03-03 10:42:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:09,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:09,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:09,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:09,799 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-03 10:42:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:13,195 INFO L93 Difference]: Finished difference Result 3082 states and 5686 transitions. [2025-03-03 10:42:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:13,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 10:42:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:13,217 INFO L225 Difference]: With dead ends: 3082 [2025-03-03 10:42:13,217 INFO L226 Difference]: Without dead ends: 1899 [2025-03-03 10:42:13,223 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-03 10:42:13,226 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 984 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:13,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 646 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 10:42:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-03-03 10:42:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2025-03-03 10:42:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 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-03 10:42:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2025-03-03 10:42:13,332 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 55 [2025-03-03 10:42:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:13,333 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2025-03-03 10:42:13,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-03 10:42:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2025-03-03 10:42:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 10:42:13,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:13,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:13,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:42:13,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:13,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1529122615, now seen corresponding path program 1 times [2025-03-03 10:42:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030851071] [2025-03-03 10:42:13,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:13,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 10:42:13,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 10:42:13,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:13,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:13,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:13,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030851071] [2025-03-03 10:42:13,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030851071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:13,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:13,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:13,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367897642] [2025-03-03 10:42:13,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:13,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:13,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:13,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:13,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:13,690 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-03 10:42:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:16,880 INFO L93 Difference]: Finished difference Result 5439 states and 9567 transitions. [2025-03-03 10:42:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:16,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-03 10:42:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:16,893 INFO L225 Difference]: With dead ends: 5439 [2025-03-03 10:42:16,893 INFO L226 Difference]: Without dead ends: 3547 [2025-03-03 10:42:16,897 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-03 10:42:16,898 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 817 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3128 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 3128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:16,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 882 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 3128 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:42:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2025-03-03 10:42:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3484. [2025-03-03 10:42:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3483 states have (on average 1.5868504163077806) internal successors, (5527), 3483 states have internal predecessors, (5527), 0 states have call successors, (0), 0 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-03 10:42:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5527 transitions. [2025-03-03 10:42:16,967 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5527 transitions. Word has length 120 [2025-03-03 10:42:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:16,969 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 5527 transitions. [2025-03-03 10:42:16,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-03 10:42:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5527 transitions. [2025-03-03 10:42:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 10:42:16,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:16,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:16,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:42:16,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:16,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash -69083111, now seen corresponding path program 1 times [2025-03-03 10:42:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313818421] [2025-03-03 10:42:16,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:17,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 10:42:17,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 10:42:17,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:17,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313818421] [2025-03-03 10:42:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313818421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:17,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:17,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:17,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157430615] [2025-03-03 10:42:17,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:17,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:17,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:17,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:17,165 INFO L87 Difference]: Start difference. First operand 3484 states and 5527 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-03 10:42:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:19,859 INFO L93 Difference]: Finished difference Result 10138 states and 16137 transitions. [2025-03-03 10:42:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:19,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-03 10:42:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:19,881 INFO L225 Difference]: With dead ends: 10138 [2025-03-03 10:42:19,881 INFO L226 Difference]: Without dead ends: 6656 [2025-03-03 10:42:19,888 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-03 10:42:19,890 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 871 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:19,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1136 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:42:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2025-03-03 10:42:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6655. [2025-03-03 10:42:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 1.4174932371505862) internal successors, (9432), 6654 states have internal predecessors, (9432), 0 states have call successors, (0), 0 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-03 10:42:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9432 transitions. [2025-03-03 10:42:20,016 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9432 transitions. Word has length 121 [2025-03-03 10:42:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:20,017 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9432 transitions. [2025-03-03 10:42:20,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-03 10:42:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9432 transitions. [2025-03-03 10:42:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 10:42:20,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:20,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:20,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:42:20,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:20,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash 527940755, now seen corresponding path program 1 times [2025-03-03 10:42:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:20,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483802555] [2025-03-03 10:42:20,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:20,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:20,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 10:42:20,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 10:42:20,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:20,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:20,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:20,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483802555] [2025-03-03 10:42:20,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483802555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:20,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:20,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411876171] [2025-03-03 10:42:20,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:20,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:20,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:20,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:20,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:20,153 INFO L87 Difference]: Start difference. First operand 6655 states and 9432 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-03 10:42:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:23,074 INFO L93 Difference]: Finished difference Result 14120 states and 20675 transitions. [2025-03-03 10:42:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:23,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 10:42:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:23,092 INFO L225 Difference]: With dead ends: 14120 [2025-03-03 10:42:23,093 INFO L226 Difference]: Without dead ends: 7467 [2025-03-03 10:42:23,100 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-03 10:42:23,101 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 872 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:23,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1176 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:42:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2025-03-03 10:42:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7456. [2025-03-03 10:42:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3389671361502347) internal successors, (9982), 7455 states have internal predecessors, (9982), 0 states have call successors, (0), 0 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-03 10:42:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9982 transitions. [2025-03-03 10:42:23,201 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9982 transitions. Word has length 124 [2025-03-03 10:42:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:23,201 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9982 transitions. [2025-03-03 10:42:23,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-03 10:42:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9982 transitions. [2025-03-03 10:42:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 10:42:23,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:23,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:42:23,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:42:23,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash -35675388, now seen corresponding path program 1 times [2025-03-03 10:42:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230749741] [2025-03-03 10:42:23,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:23,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 10:42:23,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 10:42:23,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:23,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230749741] [2025-03-03 10:42:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230749741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:23,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:23,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:23,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318534831] [2025-03-03 10:42:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:23,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:23,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:23,473 INFO L87 Difference]: Start difference. First operand 7456 states and 9982 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:25,700 INFO L93 Difference]: Finished difference Result 14123 states and 19150 transitions. [2025-03-03 10:42:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:25,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2025-03-03 10:42:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:25,716 INFO L225 Difference]: With dead ends: 14123 [2025-03-03 10:42:25,717 INFO L226 Difference]: Without dead ends: 7456 [2025-03-03 10:42:25,721 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-03 10:42:25,722 INFO L435 NwaCegarLoop]: 1086 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:25,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1215 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:42:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2025-03-03 10:42:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7456. [2025-03-03 10:42:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3362843729040912) internal successors, (9962), 7455 states have internal predecessors, (9962), 0 states have call successors, (0), 0 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-03 10:42:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9962 transitions. [2025-03-03 10:42:25,807 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9962 transitions. Word has length 166 [2025-03-03 10:42:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:25,807 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9962 transitions. [2025-03-03 10:42:25,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9962 transitions. [2025-03-03 10:42:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 10:42:25,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:25,810 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:42:25,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:42:25,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash -492143826, now seen corresponding path program 1 times [2025-03-03 10:42:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:25,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280464671] [2025-03-03 10:42:25,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:25,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 10:42:25,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 10:42:25,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:25,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:25,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280464671] [2025-03-03 10:42:25,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280464671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:25,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:25,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:25,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866267171] [2025-03-03 10:42:25,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:25,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:25,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:25,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:25,906 INFO L87 Difference]: Start difference. First operand 7456 states and 9962 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:28,533 INFO L93 Difference]: Finished difference Result 20416 states and 27798 transitions. [2025-03-03 10:42:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:28,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2025-03-03 10:42:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:28,561 INFO L225 Difference]: With dead ends: 20416 [2025-03-03 10:42:28,561 INFO L226 Difference]: Without dead ends: 13749 [2025-03-03 10:42:28,567 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-03 10:42:28,567 INFO L435 NwaCegarLoop]: 1867 mSDtfsCounter, 879 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:28,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 2007 Invalid, 3292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:42:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13749 states. [2025-03-03 10:42:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13749 to 13744. [2025-03-03 10:42:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13744 states, 13743 states have (on average 1.2572946227170196) internal successors, (17279), 13743 states have internal predecessors, (17279), 0 states have call successors, (0), 0 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-03 10:42:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13744 states to 13744 states and 17279 transitions. [2025-03-03 10:42:28,703 INFO L78 Accepts]: Start accepts. Automaton has 13744 states and 17279 transitions. Word has length 180 [2025-03-03 10:42:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:28,704 INFO L471 AbstractCegarLoop]: Abstraction has 13744 states and 17279 transitions. [2025-03-03 10:42:28,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 13744 states and 17279 transitions. [2025-03-03 10:42:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 10:42:28,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:28,709 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:42:28,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:42:28,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:28,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1349788802, now seen corresponding path program 1 times [2025-03-03 10:42:28,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:28,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906754111] [2025-03-03 10:42:28,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:28,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:28,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 10:42:28,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 10:42:28,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:28,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:28,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906754111] [2025-03-03 10:42:28,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906754111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:28,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:28,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442812201] [2025-03-03 10:42:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:28,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:28,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:28,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:28,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:28,988 INFO L87 Difference]: Start difference. First operand 13744 states and 17279 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-03 10:42:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:31,802 INFO L93 Difference]: Finished difference Result 37744 states and 48083 transitions. [2025-03-03 10:42:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2025-03-03 10:42:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:31,834 INFO L225 Difference]: With dead ends: 37744 [2025-03-03 10:42:31,835 INFO L226 Difference]: Without dead ends: 23211 [2025-03-03 10:42:31,849 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-03 10:42:31,850 INFO L435 NwaCegarLoop]: 1819 mSDtfsCounter, 753 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 3297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:31,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1960 Invalid, 3297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:42:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23211 states. [2025-03-03 10:42:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23211 to 22399. [2025-03-03 10:42:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22399 states, 22398 states have (on average 1.1936333601214395) internal successors, (26735), 22398 states have internal predecessors, (26735), 0 states have call successors, (0), 0 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-03 10:42:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22399 states to 22399 states and 26735 transitions. [2025-03-03 10:42:32,068 INFO L78 Accepts]: Start accepts. Automaton has 22399 states and 26735 transitions. Word has length 267 [2025-03-03 10:42:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:32,068 INFO L471 AbstractCegarLoop]: Abstraction has 22399 states and 26735 transitions. [2025-03-03 10:42:32,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-03 10:42:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 22399 states and 26735 transitions. [2025-03-03 10:42:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-03 10:42:32,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:32,073 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:32,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:42:32,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:32,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:32,073 INFO L85 PathProgramCache]: Analyzing trace with hash 270728023, now seen corresponding path program 1 times [2025-03-03 10:42:32,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:32,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031655294] [2025-03-03 10:42:32,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:32,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:32,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-03 10:42:32,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-03 10:42:32,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:32,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 10:42:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:32,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031655294] [2025-03-03 10:42:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031655294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:32,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:32,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066280759] [2025-03-03 10:42:32,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:32,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:42:32,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:32,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:42:32,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:42:32,278 INFO L87 Difference]: Start difference. First operand 22399 states and 26735 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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-03 10:42:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:37,469 INFO L93 Difference]: Finished difference Result 80431 states and 97056 transitions. [2025-03-03 10:42:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:42:37,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 321 [2025-03-03 10:42:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:37,537 INFO L225 Difference]: With dead ends: 80431 [2025-03-03 10:42:37,537 INFO L226 Difference]: Without dead ends: 58821 [2025-03-03 10:42:37,563 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-03 10:42:37,564 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 1720 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 6129 mSolverCounterSat, 984 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 7113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 984 IncrementalHoareTripleChecker+Valid, 6129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:37,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 1211 Invalid, 7113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [984 Valid, 6129 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-03 10:42:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58821 states. [2025-03-03 10:42:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58821 to 57115. [2025-03-03 10:42:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57115 states, 57114 states have (on average 1.1770143922680953) internal successors, (67224), 57114 states have internal predecessors, (67224), 0 states have call successors, (0), 0 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-03 10:42:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57115 states to 57115 states and 67224 transitions. [2025-03-03 10:42:38,212 INFO L78 Accepts]: Start accepts. Automaton has 57115 states and 67224 transitions. Word has length 321 [2025-03-03 10:42:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:38,212 INFO L471 AbstractCegarLoop]: Abstraction has 57115 states and 67224 transitions. [2025-03-03 10:42:38,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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-03 10:42:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 57115 states and 67224 transitions. [2025-03-03 10:42:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-03 10:42:38,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:38,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:42:38,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:42:38,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:38,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash 624347496, now seen corresponding path program 1 times [2025-03-03 10:42:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911038486] [2025-03-03 10:42:38,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:38,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-03 10:42:38,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-03 10:42:38,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:38,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:42:38,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:38,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911038486] [2025-03-03 10:42:38,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911038486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:38,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770782965] [2025-03-03 10:42:38,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:38,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:38,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:38,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:38,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:38,405 INFO L87 Difference]: Start difference. First operand 57115 states and 67224 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:41,644 INFO L93 Difference]: Finished difference Result 140208 states and 167338 transitions. [2025-03-03 10:42:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-03-03 10:42:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:41,737 INFO L225 Difference]: With dead ends: 140208 [2025-03-03 10:42:41,737 INFO L226 Difference]: Without dead ends: 83882 [2025-03-03 10:42:41,768 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-03 10:42:41,768 INFO L435 NwaCegarLoop]: 1868 mSDtfsCounter, 788 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 3304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:41,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 2010 Invalid, 3304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:42:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83882 states. [2025-03-03 10:42:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83882 to 81514. [2025-03-03 10:42:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81514 states, 81513 states have (on average 1.1452651724264842) internal successors, (93354), 81513 states have internal predecessors, (93354), 0 states have call successors, (0), 0 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-03 10:42:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81514 states to 81514 states and 93354 transitions. [2025-03-03 10:42:42,737 INFO L78 Accepts]: Start accepts. Automaton has 81514 states and 93354 transitions. Word has length 346 [2025-03-03 10:42:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:42,737 INFO L471 AbstractCegarLoop]: Abstraction has 81514 states and 93354 transitions. [2025-03-03 10:42:42,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 81514 states and 93354 transitions. [2025-03-03 10:42:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-03 10:42:42,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:42,744 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:42,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:42:42,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:42,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:42,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1463274134, now seen corresponding path program 1 times [2025-03-03 10:42:42,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:42,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121275929] [2025-03-03 10:42:42,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:42,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:42,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 10:42:42,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 10:42:42,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:42,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 234 proven. 113 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 10:42:43,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:43,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121275929] [2025-03-03 10:42:43,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121275929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562460575] [2025-03-03 10:42:43,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:43,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:43,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:43,861 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-03 10:42:43,863 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-03 10:42:43,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 10:42:43,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 10:42:43,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:43,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:43,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:42:43,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:42:44,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562460575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:44,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:42:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305901061] [2025-03-03 10:42:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:44,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:44,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:44,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:44,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:44,099 INFO L87 Difference]: Start difference. First operand 81514 states and 93354 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-03 10:42:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:46,654 INFO L93 Difference]: Finished difference Result 162228 states and 185904 transitions. [2025-03-03 10:42:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:46,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 361 [2025-03-03 10:42:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:46,752 INFO L225 Difference]: With dead ends: 162228 [2025-03-03 10:42:46,752 INFO L226 Difference]: Without dead ends: 81503 [2025-03-03 10:42:46,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:46,805 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 1077 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:46,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 797 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:42:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81503 states. [2025-03-03 10:42:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81503 to 81500. [2025-03-03 10:42:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81500 states, 81499 states have (on average 1.107620952404324) internal successors, (90270), 81499 states have internal predecessors, (90270), 0 states have call successors, (0), 0 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-03 10:42:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81500 states to 81500 states and 90270 transitions. [2025-03-03 10:42:47,593 INFO L78 Accepts]: Start accepts. Automaton has 81500 states and 90270 transitions. Word has length 361 [2025-03-03 10:42:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:47,593 INFO L471 AbstractCegarLoop]: Abstraction has 81500 states and 90270 transitions. [2025-03-03 10:42:47,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-03 10:42:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 81500 states and 90270 transitions. [2025-03-03 10:42:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-03 10:42:47,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:47,596 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:47,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:42:47,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 10:42:47,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:47,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1870844657, now seen corresponding path program 1 times [2025-03-03 10:42:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:47,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960199374] [2025-03-03 10:42:47,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:47,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:47,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 10:42:47,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 10:42:47,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:47,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 238 proven. 113 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 10:42:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960199374] [2025-03-03 10:42:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960199374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:48,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351815730] [2025-03-03 10:42:48,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:48,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:48,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:48,954 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-03 10:42:48,955 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-03 10:42:48,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 10:42:49,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 10:42:49,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:49,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:49,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:42:49,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:42:49,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:49,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351815730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:49,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:49,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:42:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587521324] [2025-03-03 10:42:49,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:49,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:49,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:49,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:49,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:49,125 INFO L87 Difference]: Start difference. First operand 81500 states and 90270 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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-03 10:42:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:51,721 INFO L93 Difference]: Finished difference Result 162209 states and 179745 transitions. [2025-03-03 10:42:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:51,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 363 [2025-03-03 10:42:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:51,828 INFO L225 Difference]: With dead ends: 162209 [2025-03-03 10:42:51,828 INFO L226 Difference]: Without dead ends: 81498 [2025-03-03 10:42:51,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:51,881 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1131 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:51,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 1422 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:42:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81498 states. [2025-03-03 10:42:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81498 to 81497. [2025-03-03 10:42:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81497 states, 81496 states have (on average 1.0818935898694415) internal successors, (88170), 81496 states have internal predecessors, (88170), 0 states have call successors, (0), 0 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-03 10:42:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81497 states to 81497 states and 88170 transitions. [2025-03-03 10:42:52,850 INFO L78 Accepts]: Start accepts. Automaton has 81497 states and 88170 transitions. Word has length 363 [2025-03-03 10:42:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:52,851 INFO L471 AbstractCegarLoop]: Abstraction has 81497 states and 88170 transitions. [2025-03-03 10:42:52,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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-03 10:42:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 81497 states and 88170 transitions. [2025-03-03 10:42:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-03 10:42:52,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:52,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:52,863 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-03 10:42:53,058 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,SelfDestructingSolverStorable10 [2025-03-03 10:42:53,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2104228188, now seen corresponding path program 1 times [2025-03-03 10:42:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228134910] [2025-03-03 10:42:53,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:53,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-03 10:42:53,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-03 10:42:53,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:53,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 318 proven. 113 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 10:42:53,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:53,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228134910] [2025-03-03 10:42:53,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228134910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:53,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241177315] [2025-03-03 10:42:53,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:53,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:53,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:54,000 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-03 10:42:54,001 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-03 10:42:54,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-03 10:42:54,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-03 10:42:54,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:54,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:54,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:42:54,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:42:54,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:54,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241177315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:54,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:54,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:42:54,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292982803] [2025-03-03 10:42:54,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:54,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:54,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:54,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:54,213 INFO L87 Difference]: Start difference. First operand 81497 states and 88170 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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-03 10:42:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:57,119 INFO L93 Difference]: Finished difference Result 159828 states and 174430 transitions. [2025-03-03 10:42:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 403 [2025-03-03 10:42:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:57,231 INFO L225 Difference]: With dead ends: 159828 [2025-03-03 10:42:57,232 INFO L226 Difference]: Without dead ends: 90935 [2025-03-03 10:42:57,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:57,280 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1215 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 3186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 926 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:57,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 403 Invalid, 3186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [926 Valid, 2260 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:42:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90935 states. [2025-03-03 10:42:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90935 to 90935. [2025-03-03 10:42:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90935 states, 90934 states have (on average 1.0858754701211868) internal successors, (98743), 90934 states have internal predecessors, (98743), 0 states have call successors, (0), 0 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-03 10:42:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90935 states to 90935 states and 98743 transitions. [2025-03-03 10:42:58,086 INFO L78 Accepts]: Start accepts. Automaton has 90935 states and 98743 transitions. Word has length 403 [2025-03-03 10:42:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:58,086 INFO L471 AbstractCegarLoop]: Abstraction has 90935 states and 98743 transitions. [2025-03-03 10:42:58,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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-03 10:42:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 90935 states and 98743 transitions. [2025-03-03 10:42:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-03-03 10:42:58,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:58,093 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:58,099 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-03 10:42:58,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:58,294 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:58,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1792143902, now seen corresponding path program 1 times [2025-03-03 10:42:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:58,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868533856] [2025-03-03 10:42:58,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:58,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-03 10:42:58,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-03 10:42:58,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:58,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 330 proven. 113 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 10:42:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:59,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868533856] [2025-03-03 10:42:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868533856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:59,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864519282] [2025-03-03 10:42:59,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:59,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:59,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:59,323 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-03 10:42:59,324 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-03 10:42:59,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-03 10:42:59,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-03 10:42:59,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:59,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:59,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:42:59,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-03 10:42:59,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864519282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:59,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:59,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:42:59,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527300700] [2025-03-03 10:42:59,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:59,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:59,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:59,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:59,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:59,515 INFO L87 Difference]: Start difference. First operand 90935 states and 98743 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-03 10:43:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:03,086 INFO L93 Difference]: Finished difference Result 199166 states and 216716 transitions. [2025-03-03 10:43:03,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:03,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 411 [2025-03-03 10:43:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:03,225 INFO L225 Difference]: With dead ends: 199166 [2025-03-03 10:43:03,225 INFO L226 Difference]: Without dead ends: 119257 [2025-03-03 10:43:03,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:43:03,277 INFO L435 NwaCegarLoop]: 1676 mSDtfsCounter, 893 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 3408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:03,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 1791 Invalid, 3408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:43:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119257 states. [2025-03-03 10:43:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119257 to 115321. [2025-03-03 10:43:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115321 states, 115320 states have (on average 1.0716007630939992) internal successors, (123577), 115320 states have internal predecessors, (123577), 0 states have call successors, (0), 0 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-03 10:43:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115321 states to 115321 states and 123577 transitions. [2025-03-03 10:43:04,605 INFO L78 Accepts]: Start accepts. Automaton has 115321 states and 123577 transitions. Word has length 411 [2025-03-03 10:43:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:04,605 INFO L471 AbstractCegarLoop]: Abstraction has 115321 states and 123577 transitions. [2025-03-03 10:43:04,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-03 10:43:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 115321 states and 123577 transitions. [2025-03-03 10:43:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-03 10:43:04,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:04,612 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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-03 10:43:04,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:43:04,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:04,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:04,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash -313343664, now seen corresponding path program 1 times [2025-03-03 10:43:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987772350] [2025-03-03 10:43:04,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:04,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-03 10:43:04,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-03 10:43:04,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:04,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:43:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:05,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987772350] [2025-03-03 10:43:05,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987772350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:05,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:05,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:43:05,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207862957] [2025-03-03 10:43:05,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:05,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:05,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:05,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:05,201 INFO L87 Difference]: Start difference. First operand 115321 states and 123577 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-03 10:43:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:08,794 INFO L93 Difference]: Finished difference Result 257416 states and 277351 transitions. [2025-03-03 10:43:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:08,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 436 [2025-03-03 10:43:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:08,982 INFO L225 Difference]: With dead ends: 257416 [2025-03-03 10:43:08,982 INFO L226 Difference]: Without dead ends: 142884 [2025-03-03 10:43:09,063 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-03 10:43:09,063 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 794 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 760 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 760 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:09,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1116 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [760 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:43:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142884 states. [2025-03-03 10:43:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142884 to 139715. [2025-03-03 10:43:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139715 states, 139714 states have (on average 1.062885609173025) internal successors, (148500), 139714 states have internal predecessors, (148500), 0 states have call successors, (0), 0 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-03 10:43:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139715 states to 139715 states and 148500 transitions. [2025-03-03 10:43:10,458 INFO L78 Accepts]: Start accepts. Automaton has 139715 states and 148500 transitions. Word has length 436 [2025-03-03 10:43:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:10,458 INFO L471 AbstractCegarLoop]: Abstraction has 139715 states and 148500 transitions. [2025-03-03 10:43:10,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-03 10:43:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 139715 states and 148500 transitions. [2025-03-03 10:43:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-03 10:43:10,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:10,464 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:10,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:43:10,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:10,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash 26805831, now seen corresponding path program 1 times [2025-03-03 10:43:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241038821] [2025-03-03 10:43:10,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:10,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-03 10:43:10,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-03 10:43:10,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:10,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 406 proven. 110 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-03 10:43:11,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:11,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241038821] [2025-03-03 10:43:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241038821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:43:11,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658697863] [2025-03-03 10:43:11,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:11,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:43:11,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:11,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:43:11,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:43:11,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-03 10:43:11,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-03 10:43:11,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:11,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:11,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:43:11,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:43:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2025-03-03 10:43:11,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:43:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658697863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:11,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:43:11,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:43:11,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329861396] [2025-03-03 10:43:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:11,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:11,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:11,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:11,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:43:11,506 INFO L87 Difference]: Start difference. First operand 139715 states and 148500 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-03 10:43:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:14,305 INFO L93 Difference]: Finished difference Result 281786 states and 299373 transitions. [2025-03-03 10:43:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:14,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 446 [2025-03-03 10:43:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:14,478 INFO L225 Difference]: With dead ends: 281786 [2025-03-03 10:43:14,478 INFO L226 Difference]: Without dead ends: 142860 [2025-03-03 10:43:14,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:43:14,555 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 980 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:14,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1436 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:43:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142860 states. [2025-03-03 10:43:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142860 to 139698. [2025-03-03 10:43:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139698 states, 139697 states have (on average 1.051518643922203) internal successors, (146894), 139697 states have internal predecessors, (146894), 0 states have call successors, (0), 0 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-03 10:43:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139698 states to 139698 states and 146894 transitions. [2025-03-03 10:43:15,908 INFO L78 Accepts]: Start accepts. Automaton has 139698 states and 146894 transitions. Word has length 446 [2025-03-03 10:43:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:15,908 INFO L471 AbstractCegarLoop]: Abstraction has 139698 states and 146894 transitions. [2025-03-03 10:43:15,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-03 10:43:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 139698 states and 146894 transitions. [2025-03-03 10:43:15,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-03 10:43:15,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:15,916 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-03 10:43:15,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:43:16,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:43:16,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:16,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2012727929, now seen corresponding path program 1 times [2025-03-03 10:43:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:16,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168540928] [2025-03-03 10:43:16,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:16,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-03 10:43:16,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-03 10:43:16,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:16,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-03-03 10:43:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168540928] [2025-03-03 10:43:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168540928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:16,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:16,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:43:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96456577] [2025-03-03 10:43:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:16,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:43:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:16,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:43:16,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:43:16,318 INFO L87 Difference]: Start difference. First operand 139698 states and 146894 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 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-03 10:43:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:23,297 INFO L93 Difference]: Finished difference Result 334607 states and 352214 transitions. [2025-03-03 10:43:23,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:43:23,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 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 486 [2025-03-03 10:43:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:23,545 INFO L225 Difference]: With dead ends: 334607 [2025-03-03 10:43:23,545 INFO L226 Difference]: Without dead ends: 195698 [2025-03-03 10:43:23,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:43:23,632 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 1746 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 7836 mSolverCounterSat, 991 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 8827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 991 IncrementalHoareTripleChecker+Valid, 7836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:23,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 1666 Invalid, 8827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [991 Valid, 7836 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-03-03 10:43:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195698 states. [2025-03-03 10:43:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195698 to 189302. [2025-03-03 10:43:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189302 states, 189301 states have (on average 1.0496616499648708) internal successors, (198702), 189301 states have internal predecessors, (198702), 0 states have call successors, (0), 0 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-03 10:43:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189302 states to 189302 states and 198702 transitions. [2025-03-03 10:43:25,549 INFO L78 Accepts]: Start accepts. Automaton has 189302 states and 198702 transitions. Word has length 486 [2025-03-03 10:43:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:25,550 INFO L471 AbstractCegarLoop]: Abstraction has 189302 states and 198702 transitions. [2025-03-03 10:43:25,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 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-03 10:43:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 189302 states and 198702 transitions. [2025-03-03 10:43:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2025-03-03 10:43:25,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:25,601 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:43:25,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:43:25,601 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:25,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash -104110279, now seen corresponding path program 1 times [2025-03-03 10:43:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963543272] [2025-03-03 10:43:25,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:25,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 831 statements into 1 equivalence classes. [2025-03-03 10:43:25,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 831 of 831 statements. [2025-03-03 10:43:25,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:25,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat