./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.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 60893087aa786664ad64540c06a3cfd94f74ea911d6a1d2cfa0eca217367fc44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:33:30,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:33:30,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:33:30,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:33:30,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:33:30,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:33:30,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:33:30,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:33:30,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:33:30,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:33:30,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:33:30,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:33:30,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:33:30,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:33:30,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:33:30,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:33:30,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:33:30,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:33:30,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:33:30,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:33:30,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:33:30,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:33:30,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:33:30,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:33:30,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:33:30,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:33:30,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:33:30,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:33:30,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:33:30,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:33:30,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:33:30,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:33:30,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:33:30,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:33:30,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:33:30,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:33:30,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:33:30,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:33:30,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:33:30,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:33:30,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:33:30,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:33:30,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:33:30,655 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 -> 60893087aa786664ad64540c06a3cfd94f74ea911d6a1d2cfa0eca217367fc44 [2025-03-16 20:33:30,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:33:30,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:33:30,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:33:30,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:33:30,877 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:33:30,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.c [2025-03-16 20:33:32,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f614a2c42/07f68dfc31ba45b38e9340795397e6bd/FLAG298a6c536 [2025-03-16 20:33:32,523 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:33:32,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.c [2025-03-16 20:33:32,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f614a2c42/07f68dfc31ba45b38e9340795397e6bd/FLAG298a6c536 [2025-03-16 20:33:32,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f614a2c42/07f68dfc31ba45b38e9340795397e6bd [2025-03-16 20:33:32,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:33:32,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:33:32,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:33:32,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:33:32,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:33:32,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:33:32" (1/1) ... [2025-03-16 20:33:32,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:32, skipping insertion in model container [2025-03-16 20:33:32,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:33:32" (1/1) ... [2025-03-16 20:33:32,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:33:33,007 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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.c[20463,20476] [2025-03-16 20:33:33,054 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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.c[26018,26031] [2025-03-16 20:33:33,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:33:33,460 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:33:33,488 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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.c[20463,20476] [2025-03-16 20:33:33,493 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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.c[26018,26031] [2025-03-16 20:33:33,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:33:33,745 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:33:33,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33 WrapperNode [2025-03-16 20:33:33,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:33:33,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:33:33,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:33:33,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:33:33,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:33,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,004 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5216 [2025-03-16 20:33:34,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:33:34,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:33:34,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:33:34,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:33:34,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,157 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:33:34,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:33:34,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:33:34,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:33:34,385 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:33:34,386 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (1/1) ... [2025-03-16 20:33:34,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:33:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:33:34,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:33:34,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:33:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:33:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:33:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:33:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:33:34,507 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:33:34,508 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:33:37,743 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5256: havoc calculate_output3_#t~ret48#1; [2025-03-16 20:33:37,744 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc calculate_output_#t~ret46#1; [2025-03-16 20:33:37,744 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3766: havoc calculate_output2_#t~ret47#1; [2025-03-16 20:33:37,844 INFO L? ?]: Removed 751 outVars from TransFormulas that were not future-live. [2025-03-16 20:33:37,845 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:33:37,868 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:33:37,868 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:33:37,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:33:37 BoogieIcfgContainer [2025-03-16 20:33:37,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:33:37,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:33:37,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:33:37,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:33:37,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:33:32" (1/3) ... [2025-03-16 20:33:37,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4a5118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:33:37, skipping insertion in model container [2025-03-16 20:33:37,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:33" (2/3) ... [2025-03-16 20:33:37,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4a5118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:33:37, skipping insertion in model container [2025-03-16 20:33:37,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:33:37" (3/3) ... [2025-03-16 20:33:37,875 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.c [2025-03-16 20:33:37,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:33:37,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label01.c that has 1 procedures, 865 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:33:37,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:33:37,952 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;@5916a484, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:33:37,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:33:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 865 states, 862 states have (on average 1.9698375870069607) internal successors, (1698), 864 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 20:33:37,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:37,961 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] [2025-03-16 20:33:37,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:37,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1170770383, now seen corresponding path program 1 times [2025-03-16 20:33:37,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:37,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252758679] [2025-03-16 20:33:37,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:38,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 20:33:38,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 20:33:38,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:38,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:38,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:38,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252758679] [2025-03-16 20:33:38,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252758679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:38,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:38,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:33:38,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131789691] [2025-03-16 20:33:38,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:38,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:33:38,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:38,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:33:38,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:33:38,186 INFO L87 Difference]: Start difference. First operand has 865 states, 862 states have (on average 1.9698375870069607) internal successors, (1698), 864 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:38,254 INFO L93 Difference]: Finished difference Result 1676 states and 3290 transitions. [2025-03-16 20:33:38,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:33:38,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-16 20:33:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:38,272 INFO L225 Difference]: With dead ends: 1676 [2025-03-16 20:33:38,273 INFO L226 Difference]: Without dead ends: 861 [2025-03-16 20:33:38,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:33:38,281 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:38,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-16 20:33:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2025-03-16 20:33:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 1.8963911525029105) internal successors, (1629), 860 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1629 transitions. [2025-03-16 20:33:38,349 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1629 transitions. Word has length 25 [2025-03-16 20:33:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:38,349 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1629 transitions. [2025-03-16 20:33:38,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1629 transitions. [2025-03-16 20:33:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 20:33:38,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:38,352 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] [2025-03-16 20:33:38,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:33:38,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:38,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1382121296, now seen corresponding path program 1 times [2025-03-16 20:33:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:38,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430921456] [2025-03-16 20:33:38,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:38,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 20:33:38,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 20:33:38,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:38,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:38,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430921456] [2025-03-16 20:33:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430921456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:38,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:33:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229676038] [2025-03-16 20:33:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:33:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:38,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:33:38,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:33:38,563 INFO L87 Difference]: Start difference. First operand 861 states and 1629 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:38,677 INFO L93 Difference]: Finished difference Result 917 states and 1718 transitions. [2025-03-16 20:33:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:33:38,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-16 20:33:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:38,683 INFO L225 Difference]: With dead ends: 917 [2025-03-16 20:33:38,684 INFO L226 Difference]: Without dead ends: 861 [2025-03-16 20:33:38,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:33:38,685 INFO L435 NwaCegarLoop]: 1628 mSDtfsCounter, 0 mSDsluCounter, 3202 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4830 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:38,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4830 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:33:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-16 20:33:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2025-03-16 20:33:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 1.838183934807916) internal successors, (1579), 860 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1579 transitions. [2025-03-16 20:33:38,713 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1579 transitions. Word has length 25 [2025-03-16 20:33:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:38,713 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1579 transitions. [2025-03-16 20:33:38,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1579 transitions. [2025-03-16 20:33:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:33:38,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:38,716 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] [2025-03-16 20:33:38,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:33:38,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:38,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 559192462, now seen corresponding path program 1 times [2025-03-16 20:33:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:38,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178012642] [2025-03-16 20:33:38,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:38,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:38,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:33:38,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:33:38,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:38,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:38,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178012642] [2025-03-16 20:33:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178012642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:33:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366839605] [2025-03-16 20:33:38,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:38,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:33:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:38,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:33:38,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:33:38,909 INFO L87 Difference]: Start difference. First operand 861 states and 1579 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:43,424 INFO L93 Difference]: Finished difference Result 3116 states and 5888 transitions. [2025-03-16 20:33:43,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:33:43,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 20:33:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:43,433 INFO L225 Difference]: With dead ends: 3116 [2025-03-16 20:33:43,433 INFO L226 Difference]: Without dead ends: 2363 [2025-03-16 20:33:43,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:33:43,434 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 2498 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2498 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:43,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2498 Valid, 833 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 20:33:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2025-03-16 20:33:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2025-03-16 20:33:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2361 states have (on average 1.5641677255400255) internal successors, (3693), 2362 states have internal predecessors, (3693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3693 transitions. [2025-03-16 20:33:43,474 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3693 transitions. Word has length 47 [2025-03-16 20:33:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:43,475 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3693 transitions. [2025-03-16 20:33:43,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3693 transitions. [2025-03-16 20:33:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 20:33:43,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:43,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:43,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:33:43,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1833953211, now seen corresponding path program 1 times [2025-03-16 20:33:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:43,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967431699] [2025-03-16 20:33:43,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:43,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 20:33:43,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 20:33:43,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:43,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:43,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:43,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967431699] [2025-03-16 20:33:43,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967431699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:43,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:33:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953437982] [2025-03-16 20:33:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:43,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:33:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:43,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:33:43,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:33:43,729 INFO L87 Difference]: Start difference. First operand 2363 states and 3693 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:44,006 INFO L93 Difference]: Finished difference Result 3105 states and 4897 transitions. [2025-03-16 20:33:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 20:33:44,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-16 20:33:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:44,016 INFO L225 Difference]: With dead ends: 3105 [2025-03-16 20:33:44,016 INFO L226 Difference]: Without dead ends: 3052 [2025-03-16 20:33:44,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:33:44,018 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 11475 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11475 SdHoareTripleChecker+Valid, 5085 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:44,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11475 Valid, 5085 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:33:44,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2025-03-16 20:33:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2414. [2025-03-16 20:33:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2412 states have (on average 1.5655058043117744) internal successors, (3776), 2413 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:44,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3776 transitions. [2025-03-16 20:33:44,064 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3776 transitions. Word has length 74 [2025-03-16 20:33:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:44,065 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3776 transitions. [2025-03-16 20:33:44,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3776 transitions. [2025-03-16 20:33:44,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:33:44,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:44,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:44,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:33:44,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:44,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1455262201, now seen corresponding path program 1 times [2025-03-16 20:33:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:44,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756492741] [2025-03-16 20:33:44,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:44,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:44,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:33:44,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:33:44,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:44,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:44,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756492741] [2025-03-16 20:33:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756492741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:33:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784681588] [2025-03-16 20:33:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:44,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:33:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:44,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:33:44,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:33:44,433 INFO L87 Difference]: Start difference. First operand 2414 states and 3776 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:44,717 INFO L93 Difference]: Finished difference Result 2520 states and 3946 transitions. [2025-03-16 20:33:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:33:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-16 20:33:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:44,724 INFO L225 Difference]: With dead ends: 2520 [2025-03-16 20:33:44,724 INFO L226 Difference]: Without dead ends: 2416 [2025-03-16 20:33:44,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:33:44,726 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 7545 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7545 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:44,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7545 Valid, 2068 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:33:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-03-16 20:33:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2414. [2025-03-16 20:33:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2412 states have (on average 1.5650912106135986) internal successors, (3775), 2413 states have internal predecessors, (3775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3775 transitions. [2025-03-16 20:33:44,766 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3775 transitions. Word has length 76 [2025-03-16 20:33:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:44,766 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3775 transitions. [2025-03-16 20:33:44,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3775 transitions. [2025-03-16 20:33:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:33:44,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:44,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:44,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:33:44,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:44,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1456304886, now seen corresponding path program 1 times [2025-03-16 20:33:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:44,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070881921] [2025-03-16 20:33:44,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:44,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:33:44,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:33:44,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:44,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:44,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070881921] [2025-03-16 20:33:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070881921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:44,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:33:44,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246341011] [2025-03-16 20:33:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:44,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:33:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:44,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:33:44,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:44,842 INFO L87 Difference]: Start difference. First operand 2414 states and 3775 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:44,863 INFO L93 Difference]: Finished difference Result 2611 states and 4092 transitions. [2025-03-16 20:33:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:33:44,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-16 20:33:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:44,870 INFO L225 Difference]: With dead ends: 2611 [2025-03-16 20:33:44,871 INFO L226 Difference]: Without dead ends: 2507 [2025-03-16 20:33:44,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:44,872 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 1496 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:44,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2025-03-16 20:33:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2025-03-16 20:33:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2503 states have (on average 1.5661206552137434) internal successors, (3920), 2504 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3920 transitions. [2025-03-16 20:33:44,911 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3920 transitions. Word has length 76 [2025-03-16 20:33:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:44,911 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3920 transitions. [2025-03-16 20:33:44,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3920 transitions. [2025-03-16 20:33:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 20:33:44,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:44,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:44,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:33:44,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:44,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2132497085, now seen corresponding path program 1 times [2025-03-16 20:33:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:44,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381847734] [2025-03-16 20:33:44,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:44,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 20:33:44,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 20:33:44,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:44,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:45,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:45,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381847734] [2025-03-16 20:33:45,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381847734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:45,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:45,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:33:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098682040] [2025-03-16 20:33:45,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:45,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:33:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:45,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:33:45,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:33:45,154 INFO L87 Difference]: Start difference. First operand 2505 states and 3920 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:45,194 INFO L93 Difference]: Finished difference Result 2511 states and 3927 transitions. [2025-03-16 20:33:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:33:45,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-16 20:33:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:45,202 INFO L225 Difference]: With dead ends: 2511 [2025-03-16 20:33:45,202 INFO L226 Difference]: Without dead ends: 2509 [2025-03-16 20:33:45,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:33:45,204 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 6289 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7864 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:45,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7864 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2025-03-16 20:33:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2509. [2025-03-16 20:33:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2507 states have (on average 1.5648185081771042) internal successors, (3923), 2508 states have internal predecessors, (3923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3923 transitions. [2025-03-16 20:33:45,242 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3923 transitions. Word has length 77 [2025-03-16 20:33:45,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:45,243 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 3923 transitions. [2025-03-16 20:33:45,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3923 transitions. [2025-03-16 20:33:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:33:45,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:45,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:45,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:33:45,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:45,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1167662761, now seen corresponding path program 1 times [2025-03-16 20:33:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:45,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809088401] [2025-03-16 20:33:45,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:45,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:45,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:33:45,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:33:45,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:45,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809088401] [2025-03-16 20:33:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809088401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:45,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:45,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:33:45,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040223240] [2025-03-16 20:33:45,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:45,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:33:45,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:45,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:33:45,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:45,297 INFO L87 Difference]: Start difference. First operand 2509 states and 3923 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:45,325 INFO L93 Difference]: Finished difference Result 2719 states and 4256 transitions. [2025-03-16 20:33:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:33:45,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 20:33:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:45,333 INFO L225 Difference]: With dead ends: 2719 [2025-03-16 20:33:45,333 INFO L226 Difference]: Without dead ends: 2611 [2025-03-16 20:33:45,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:45,334 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1514 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:45,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1737 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2025-03-16 20:33:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2609. [2025-03-16 20:33:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2607 states have (on average 1.5650172612197928) internal successors, (4080), 2608 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4080 transitions. [2025-03-16 20:33:45,373 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4080 transitions. Word has length 78 [2025-03-16 20:33:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:45,375 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 4080 transitions. [2025-03-16 20:33:45,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4080 transitions. [2025-03-16 20:33:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:33:45,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:45,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:45,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:33:45,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:45,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1361821271, now seen corresponding path program 1 times [2025-03-16 20:33:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747787831] [2025-03-16 20:33:45,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:45,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:45,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:33:45,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:33:45,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:45,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:45,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747787831] [2025-03-16 20:33:45,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747787831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:45,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:45,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:33:45,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910260776] [2025-03-16 20:33:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:45,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:33:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:45,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:33:45,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:45,434 INFO L87 Difference]: Start difference. First operand 2609 states and 4080 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:45,487 INFO L93 Difference]: Finished difference Result 3179 states and 4980 transitions. [2025-03-16 20:33:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:33:45,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 20:33:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:45,495 INFO L225 Difference]: With dead ends: 3179 [2025-03-16 20:33:45,495 INFO L226 Difference]: Without dead ends: 2882 [2025-03-16 20:33:45,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:45,499 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1512 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:45,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-03-16 20:33:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2880. [2025-03-16 20:33:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2878 states have (on average 1.5642807505211953) internal successors, (4502), 2879 states have internal predecessors, (4502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4502 transitions. [2025-03-16 20:33:45,557 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4502 transitions. Word has length 78 [2025-03-16 20:33:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:45,557 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4502 transitions. [2025-03-16 20:33:45,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4502 transitions. [2025-03-16 20:33:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:33:45,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:45,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:45,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:33:45,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:45,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1652303017, now seen corresponding path program 1 times [2025-03-16 20:33:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:45,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169901098] [2025-03-16 20:33:45,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:45,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:45,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:33:45,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:33:45,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:45,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:45,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:45,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169901098] [2025-03-16 20:33:45,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169901098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:45,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:45,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:33:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124626626] [2025-03-16 20:33:45,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:45,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:33:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:45,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:33:45,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:45,622 INFO L87 Difference]: Start difference. First operand 2880 states and 4502 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:45,663 INFO L93 Difference]: Finished difference Result 3968 states and 6204 transitions. [2025-03-16 20:33:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:33:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 20:33:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:45,679 INFO L225 Difference]: With dead ends: 3968 [2025-03-16 20:33:45,679 INFO L226 Difference]: Without dead ends: 3400 [2025-03-16 20:33:45,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:45,682 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1510 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:45,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:45,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2025-03-16 20:33:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3398. [2025-03-16 20:33:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3396 states have (on average 1.5600706713780919) internal successors, (5298), 3397 states have internal predecessors, (5298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 5298 transitions. [2025-03-16 20:33:45,757 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 5298 transitions. Word has length 78 [2025-03-16 20:33:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:45,757 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 5298 transitions. [2025-03-16 20:33:45,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 5298 transitions. [2025-03-16 20:33:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:33:45,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:45,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:45,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:33:45,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:45,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1799305303, now seen corresponding path program 1 times [2025-03-16 20:33:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:45,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504925681] [2025-03-16 20:33:45,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:45,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:33:45,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:33:45,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:45,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504925681] [2025-03-16 20:33:45,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504925681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:45,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:45,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:33:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690065153] [2025-03-16 20:33:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:45,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:33:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:45,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:33:45,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:45,818 INFO L87 Difference]: Start difference. First operand 3398 states and 5298 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:45,867 INFO L93 Difference]: Finished difference Result 5474 states and 8508 transitions. [2025-03-16 20:33:45,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:33:45,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 20:33:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:45,875 INFO L225 Difference]: With dead ends: 5474 [2025-03-16 20:33:45,875 INFO L226 Difference]: Without dead ends: 4388 [2025-03-16 20:33:45,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:45,878 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1508 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:45,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4388 states. [2025-03-16 20:33:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4388 to 4386. [2025-03-16 20:33:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4386 states, 4384 states have (on average 1.5497262773722629) internal successors, (6794), 4385 states have internal predecessors, (6794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 6794 transitions. [2025-03-16 20:33:45,953 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 6794 transitions. Word has length 78 [2025-03-16 20:33:45,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:45,953 INFO L471 AbstractCegarLoop]: Abstraction has 4386 states and 6794 transitions. [2025-03-16 20:33:45,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 6794 transitions. [2025-03-16 20:33:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:33:45,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:45,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:45,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:33:45,954 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:45,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1042264663, now seen corresponding path program 1 times [2025-03-16 20:33:45,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:45,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90224079] [2025-03-16 20:33:45,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:45,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:45,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:33:45,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:33:45,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:45,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:45,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90224079] [2025-03-16 20:33:45,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90224079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:45,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:45,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:33:46,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29089533] [2025-03-16 20:33:46,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:46,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:33:46,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:46,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:33:46,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:46,000 INFO L87 Difference]: Start difference. First operand 4386 states and 6794 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:46,056 INFO L93 Difference]: Finished difference Result 8342 states and 12828 transitions. [2025-03-16 20:33:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:33:46,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 20:33:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:46,067 INFO L225 Difference]: With dead ends: 8342 [2025-03-16 20:33:46,067 INFO L226 Difference]: Without dead ends: 6268 [2025-03-16 20:33:46,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:46,071 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 1504 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:46,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2025-03-16 20:33:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6266. [2025-03-16 20:33:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6266 states, 6264 states have (on average 1.5316091954022988) internal successors, (9594), 6265 states have internal predecessors, (9594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 9594 transitions. [2025-03-16 20:33:46,179 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 9594 transitions. Word has length 78 [2025-03-16 20:33:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:46,179 INFO L471 AbstractCegarLoop]: Abstraction has 6266 states and 9594 transitions. [2025-03-16 20:33:46,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 9594 transitions. [2025-03-16 20:33:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:33:46,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:46,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:46,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:33:46,181 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1592053591, now seen corresponding path program 1 times [2025-03-16 20:33:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569968970] [2025-03-16 20:33:46,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:46,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:33:46,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:33:46,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:46,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:46,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569968970] [2025-03-16 20:33:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569968970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:46,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:46,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:33:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498663044] [2025-03-16 20:33:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:46,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:33:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:46,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:33:46,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:46,233 INFO L87 Difference]: Start difference. First operand 6266 states and 9594 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:46,375 INFO L93 Difference]: Finished difference Result 13790 states and 20892 transitions. [2025-03-16 20:33:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:33:46,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 20:33:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:46,391 INFO L225 Difference]: With dead ends: 13790 [2025-03-16 20:33:46,392 INFO L226 Difference]: Without dead ends: 9836 [2025-03-16 20:33:46,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:46,397 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 1502 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:46,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9836 states. [2025-03-16 20:33:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9836 to 9834. [2025-03-16 20:33:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9834 states, 9832 states have (on average 1.506305939788446) internal successors, (14810), 9833 states have internal predecessors, (14810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9834 states to 9834 states and 14810 transitions. [2025-03-16 20:33:46,569 INFO L78 Accepts]: Start accepts. Automaton has 9834 states and 14810 transitions. Word has length 78 [2025-03-16 20:33:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:46,569 INFO L471 AbstractCegarLoop]: Abstraction has 9834 states and 14810 transitions. [2025-03-16 20:33:46,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 9834 states and 14810 transitions. [2025-03-16 20:33:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:33:46,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:46,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:46,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:33:46,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:46,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:46,571 INFO L85 PathProgramCache]: Analyzing trace with hash -976082263, now seen corresponding path program 1 times [2025-03-16 20:33:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:46,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150507645] [2025-03-16 20:33:46,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:46,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:33:46,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:33:46,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:46,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:46,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:46,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150507645] [2025-03-16 20:33:46,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150507645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:46,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:46,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:33:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451262855] [2025-03-16 20:33:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:46,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:33:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:46,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:33:46,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:46,618 INFO L87 Difference]: Start difference. First operand 9834 states and 14810 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:46,774 INFO L93 Difference]: Finished difference Result 24110 states and 35868 transitions. [2025-03-16 20:33:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:33:46,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 20:33:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:46,804 INFO L225 Difference]: With dead ends: 24110 [2025-03-16 20:33:46,804 INFO L226 Difference]: Without dead ends: 16588 [2025-03-16 20:33:46,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:33:46,817 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1506 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:46,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:33:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16588 states. [2025-03-16 20:33:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16588 to 16586. [2025-03-16 20:33:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16586 states, 16584 states have (on average 1.4757597684515196) internal successors, (24474), 16585 states have internal predecessors, (24474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16586 states to 16586 states and 24474 transitions. [2025-03-16 20:33:47,166 INFO L78 Accepts]: Start accepts. Automaton has 16586 states and 24474 transitions. Word has length 78 [2025-03-16 20:33:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:47,167 INFO L471 AbstractCegarLoop]: Abstraction has 16586 states and 24474 transitions. [2025-03-16 20:33:47,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 16586 states and 24474 transitions. [2025-03-16 20:33:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:33:47,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:47,172 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:33:47,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:33:47,172 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:47,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash -687087655, now seen corresponding path program 1 times [2025-03-16 20:33:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:47,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354713600] [2025-03-16 20:33:47,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:47,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:33:47,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:33:47,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:47,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:33:47,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:47,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354713600] [2025-03-16 20:33:47,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354713600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:47,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:47,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:33:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93509930] [2025-03-16 20:33:47,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:47,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:33:47,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:47,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:33:47,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:33:47,351 INFO L87 Difference]: Start difference. First operand 16586 states and 24474 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:48,867 INFO L93 Difference]: Finished difference Result 115098 states and 168418 transitions. [2025-03-16 20:33:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:33:48,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 100 [2025-03-16 20:33:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:49,159 INFO L225 Difference]: With dead ends: 115098 [2025-03-16 20:33:49,159 INFO L226 Difference]: Without dead ends: 105112 [2025-03-16 20:33:49,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:33:49,185 INFO L435 NwaCegarLoop]: 1664 mSDtfsCounter, 9845 mSDsluCounter, 2966 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9845 SdHoareTripleChecker+Valid, 4630 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:49,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9845 Valid, 4630 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:33:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105112 states. [2025-03-16 20:33:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105112 to 28746. [2025-03-16 20:33:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28746 states, 28744 states have (on average 1.4637489563039243) internal successors, (42074), 28745 states have internal predecessors, (42074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28746 states to 28746 states and 42074 transitions. [2025-03-16 20:33:50,243 INFO L78 Accepts]: Start accepts. Automaton has 28746 states and 42074 transitions. Word has length 100 [2025-03-16 20:33:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:50,244 INFO L471 AbstractCegarLoop]: Abstraction has 28746 states and 42074 transitions. [2025-03-16 20:33:50,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28746 states and 42074 transitions. [2025-03-16 20:33:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:33:50,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:50,248 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:33:50,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:33:50,249 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:50,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1078395609, now seen corresponding path program 1 times [2025-03-16 20:33:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933809032] [2025-03-16 20:33:50,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:50,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:33:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:33:50,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:50,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:33:50,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:50,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933809032] [2025-03-16 20:33:50,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933809032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:50,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:50,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:33:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484335085] [2025-03-16 20:33:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:50,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:33:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:50,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:33:50,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:33:50,417 INFO L87 Difference]: Start difference. First operand 28746 states and 42074 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:52,352 INFO L93 Difference]: Finished difference Result 129370 states and 189154 transitions. [2025-03-16 20:33:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:33:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 100 [2025-03-16 20:33:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:52,563 INFO L225 Difference]: With dead ends: 129370 [2025-03-16 20:33:52,563 INFO L226 Difference]: Without dead ends: 115096 [2025-03-16 20:33:52,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:33:52,601 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9847 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9847 SdHoareTripleChecker+Valid, 4590 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:52,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9847 Valid, 4590 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:33:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115096 states. [2025-03-16 20:33:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115096 to 48010. [2025-03-16 20:33:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48010 states, 48008 states have (on average 1.4562989501749708) internal successors, (69914), 48009 states have internal predecessors, (69914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48010 states to 48010 states and 69914 transitions. [2025-03-16 20:33:54,463 INFO L78 Accepts]: Start accepts. Automaton has 48010 states and 69914 transitions. Word has length 100 [2025-03-16 20:33:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:54,463 INFO L471 AbstractCegarLoop]: Abstraction has 48010 states and 69914 transitions. [2025-03-16 20:33:54,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 48010 states and 69914 transitions. [2025-03-16 20:33:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:33:54,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:54,468 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:33:54,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:33:54,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:54,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash -202447399, now seen corresponding path program 1 times [2025-03-16 20:33:54,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:54,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264257748] [2025-03-16 20:33:54,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:54,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:33:54,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:33:54,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:54,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:33:54,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264257748] [2025-03-16 20:33:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264257748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:54,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:54,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:33:54,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680752245] [2025-03-16 20:33:54,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:54,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:33:54,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:54,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:33:54,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:33:54,637 INFO L87 Difference]: Start difference. First operand 48010 states and 69914 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:56,696 INFO L93 Difference]: Finished difference Result 143642 states and 209826 transitions. [2025-03-16 20:33:56,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:33:56,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:33:56,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:56,853 INFO L225 Difference]: With dead ends: 143642 [2025-03-16 20:33:56,854 INFO L226 Difference]: Without dead ends: 129368 [2025-03-16 20:33:56,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:33:56,882 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 9866 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9866 SdHoareTripleChecker+Valid, 4553 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:56,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9866 Valid, 4553 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:33:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129368 states. [2025-03-16 20:33:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129368 to 62282. [2025-03-16 20:33:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62282 states, 62280 states have (on average 1.454495825305074) internal successors, (90586), 62281 states have internal predecessors, (90586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62282 states to 62282 states and 90586 transitions. [2025-03-16 20:33:59,145 INFO L78 Accepts]: Start accepts. Automaton has 62282 states and 90586 transitions. Word has length 100 [2025-03-16 20:33:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:59,146 INFO L471 AbstractCegarLoop]: Abstraction has 62282 states and 90586 transitions. [2025-03-16 20:33:59,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:33:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 62282 states and 90586 transitions. [2025-03-16 20:33:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:33:59,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:59,152 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:33:59,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:33:59,152 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 640911577, now seen corresponding path program 1 times [2025-03-16 20:33:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121799387] [2025-03-16 20:33:59,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:59,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:33:59,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:33:59,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:59,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:33:59,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:59,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121799387] [2025-03-16 20:33:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121799387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:33:59,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:33:59,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:33:59,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569081672] [2025-03-16 20:33:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:33:59,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:33:59,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:59,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:33:59,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:33:59,346 INFO L87 Difference]: Start difference. First operand 62282 states and 90586 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:02,228 INFO L93 Difference]: Finished difference Result 157914 states and 230498 transitions. [2025-03-16 20:34:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:02,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 100 [2025-03-16 20:34:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:02,432 INFO L225 Difference]: With dead ends: 157914 [2025-03-16 20:34:02,432 INFO L226 Difference]: Without dead ends: 143640 [2025-03-16 20:34:02,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:02,466 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 9955 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9955 SdHoareTripleChecker+Valid, 4469 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:02,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9955 Valid, 4469 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:34:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143640 states. [2025-03-16 20:34:05,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143640 to 76554. [2025-03-16 20:34:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76554 states, 76552 states have (on average 1.4533650329188004) internal successors, (111258), 76553 states have internal predecessors, (111258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76554 states to 76554 states and 111258 transitions. [2025-03-16 20:34:05,437 INFO L78 Accepts]: Start accepts. Automaton has 76554 states and 111258 transitions. Word has length 100 [2025-03-16 20:34:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:05,437 INFO L471 AbstractCegarLoop]: Abstraction has 76554 states and 111258 transitions. [2025-03-16 20:34:05,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 76554 states and 111258 transitions. [2025-03-16 20:34:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:05,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:05,444 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:05,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:34:05,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:05,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:05,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1397952217, now seen corresponding path program 1 times [2025-03-16 20:34:05,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:05,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967000655] [2025-03-16 20:34:05,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:05,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:05,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:05,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:05,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:05,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:34:05,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:05,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967000655] [2025-03-16 20:34:05,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967000655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:05,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:05,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539672546] [2025-03-16 20:34:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:05,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:05,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:05,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:05,641 INFO L87 Difference]: Start difference. First operand 76554 states and 111258 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:09,135 INFO L93 Difference]: Finished difference Result 172186 states and 251170 transitions. [2025-03-16 20:34:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:09,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 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 100 [2025-03-16 20:34:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:09,331 INFO L225 Difference]: With dead ends: 172186 [2025-03-16 20:34:09,331 INFO L226 Difference]: Without dead ends: 157912 [2025-03-16 20:34:09,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:09,367 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 10036 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10036 SdHoareTripleChecker+Valid, 4529 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:09,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10036 Valid, 4529 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157912 states. [2025-03-16 20:34:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157912 to 90826. [2025-03-16 20:34:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90826 states, 90824 states have (on average 1.4525896238879592) internal successors, (131930), 90825 states have internal predecessors, (131930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90826 states to 90826 states and 131930 transitions. [2025-03-16 20:34:12,733 INFO L78 Accepts]: Start accepts. Automaton has 90826 states and 131930 transitions. Word has length 100 [2025-03-16 20:34:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:12,733 INFO L471 AbstractCegarLoop]: Abstraction has 90826 states and 131930 transitions. [2025-03-16 20:34:12,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 90826 states and 131930 transitions. [2025-03-16 20:34:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:12,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:12,739 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:12,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:34:12,739 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:12,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 848163289, now seen corresponding path program 1 times [2025-03-16 20:34:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:12,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897820625] [2025-03-16 20:34:12,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:12,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:12,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:12,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:12,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:12,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:34:12,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:12,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897820625] [2025-03-16 20:34:12,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897820625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:12,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:12,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:12,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474915381] [2025-03-16 20:34:12,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:12,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:12,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:12,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:12,914 INFO L87 Difference]: Start difference. First operand 90826 states and 131930 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)