./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.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 fa5f95a04d6083abdc8e62e4666afd780988fdaed849d97770096c71104c7886 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:16:00,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:16:00,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:16:00,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:16:00,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:16:00,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:16:00,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:16:00,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:16:00,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:16:00,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:16:00,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:16:00,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:16:00,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:16:00,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:16:00,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:16:00,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:16:00,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:16:00,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:16:00,778 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 -> fa5f95a04d6083abdc8e62e4666afd780988fdaed849d97770096c71104c7886 [2025-03-03 16:16:00,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:16:00,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:16:00,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:16:00,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:16:00,998 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:16:00,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c [2025-03-03 16:16:02,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4a0a4d0/4de3de0c4df84d89b6c32a6001210946/FLAG9a39e5e33 [2025-03-03 16:16:02,539 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:16:02,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c [2025-03-03 16:16:02,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4a0a4d0/4de3de0c4df84d89b6c32a6001210946/FLAG9a39e5e33 [2025-03-03 16:16:02,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4a0a4d0/4de3de0c4df84d89b6c32a6001210946 [2025-03-03 16:16:02,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:16:02,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:16:02,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:16:02,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:16:02,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:16:02,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:16:02" (1/1) ... [2025-03-03 16:16:02,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:02, skipping insertion in model container [2025-03-03 16:16:02,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:16:02" (1/1) ... [2025-03-03 16:16:02,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:16:03,103 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.ufo.BOUNDED-14.pals+Problem12_label08.c[20426,20439] [2025-03-03 16:16:03,140 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.ufo.BOUNDED-14.pals+Problem12_label08.c[23933,23946] [2025-03-03 16:16:03,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:16:03,555 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:16:03,592 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.ufo.BOUNDED-14.pals+Problem12_label08.c[20426,20439] [2025-03-03 16:16:03,599 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.ufo.BOUNDED-14.pals+Problem12_label08.c[23933,23946] [2025-03-03 16:16:03,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:16:03,865 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:16:03,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03 WrapperNode [2025-03-03 16:16:03,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:16:03,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:16:03,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:16:03,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:16:03,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:03,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,216 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5215 [2025-03-03 16:16:04,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:16:04,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:16:04,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:16:04,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:16:04,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,379 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:16:04,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:16:04,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:16:04,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:16:04,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:16:04,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (1/1) ... [2025-03-03 16:16:04,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:16:04,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:16:04,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:16:04,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:16:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:16:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:16:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:16:04,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:16:04,704 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:16:04,705 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:16:08,008 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc calculate_output_#t~ret46#1; [2025-03-03 16:16:08,008 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3764: havoc calculate_output2_#t~ret47#1; [2025-03-03 16:16:08,008 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5254: havoc calculate_output3_#t~ret48#1; [2025-03-03 16:16:08,146 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-03-03 16:16:08,146 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:16:08,177 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:16:08,177 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:16:08,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:16:08 BoogieIcfgContainer [2025-03-03 16:16:08,177 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:16:08,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:16:08,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:16:08,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:16:08,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:16:02" (1/3) ... [2025-03-03 16:16:08,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50291937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:16:08, skipping insertion in model container [2025-03-03 16:16:08,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:03" (2/3) ... [2025-03-03 16:16:08,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50291937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:16:08, skipping insertion in model container [2025-03-03 16:16:08,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:16:08" (3/3) ... [2025-03-03 16:16:08,186 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c [2025-03-03 16:16:08,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:16:08,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c that has 1 procedures, 929 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:16:08,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:16:08,277 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;@781d6551, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:16:08,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:16:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 929 states, 926 states have (on average 1.9028077753779697) internal successors, (1762), 928 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 16:16:08,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:08,292 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] [2025-03-03 16:16:08,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:08,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1420392849, now seen corresponding path program 1 times [2025-03-03 16:16:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:08,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411604741] [2025-03-03 16:16:08,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:08,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 16:16:08,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 16:16:08,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:08,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:08,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411604741] [2025-03-03 16:16:08,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411604741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:16:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778098608] [2025-03-03 16:16:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:08,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:16:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:08,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:16:08,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:16:08,550 INFO L87 Difference]: Start difference. First operand has 929 states, 926 states have (on average 1.9028077753779697) internal successors, (1762), 928 states have internal predecessors, (1762), 0 states have call successors, (0), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:08,608 INFO L93 Difference]: Finished difference Result 1802 states and 3416 transitions. [2025-03-03 16:16:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:16:08,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-03 16:16:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:08,623 INFO L225 Difference]: With dead ends: 1802 [2025-03-03 16:16:08,623 INFO L226 Difference]: Without dead ends: 864 [2025-03-03 16:16:08,627 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-03 16:16:08,629 INFO L435 NwaCegarLoop]: 1698 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, 1698 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-03 16:16:08,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-03 16:16:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-03-03 16:16:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8932714617169373) internal successors, (1632), 863 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1632 transitions. [2025-03-03 16:16:08,694 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1632 transitions. Word has length 28 [2025-03-03 16:16:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:08,695 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1632 transitions. [2025-03-03 16:16:08,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1632 transitions. [2025-03-03 16:16:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 16:16:08,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:08,696 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] [2025-03-03 16:16:08,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:16:08,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:08,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash 836518158, now seen corresponding path program 1 times [2025-03-03 16:16:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:08,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248660432] [2025-03-03 16:16:08,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:08,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:08,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 16:16:08,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 16:16:08,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:08,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:08,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:08,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248660432] [2025-03-03 16:16:08,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248660432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:08,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:08,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:16:08,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777860670] [2025-03-03 16:16:08,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:08,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:16:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:08,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:16:08,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:16:08,916 INFO L87 Difference]: Start difference. First operand 864 states and 1632 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:09,010 INFO L93 Difference]: Finished difference Result 922 states and 1723 transitions. [2025-03-03 16:16:09,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:16:09,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-03 16:16:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:09,014 INFO L225 Difference]: With dead ends: 922 [2025-03-03 16:16:09,015 INFO L226 Difference]: Without dead ends: 864 [2025-03-03 16:16:09,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:16:09,016 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 0 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6465 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:09,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6465 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:16:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-03 16:16:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-03-03 16:16:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8352668213457077) internal successors, (1582), 863 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1582 transitions. [2025-03-03 16:16:09,034 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1582 transitions. Word has length 28 [2025-03-03 16:16:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:09,034 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1582 transitions. [2025-03-03 16:16:09,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1582 transitions. [2025-03-03 16:16:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 16:16:09,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:09,035 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] [2025-03-03 16:16:09,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:16:09,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:09,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:09,035 INFO L85 PathProgramCache]: Analyzing trace with hash -969037449, now seen corresponding path program 1 times [2025-03-03 16:16:09,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:09,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951320547] [2025-03-03 16:16:09,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:09,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 16:16:09,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 16:16:09,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:09,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:09,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:09,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951320547] [2025-03-03 16:16:09,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951320547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:09,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:09,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:16:09,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834772474] [2025-03-03 16:16:09,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:09,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:09,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:09,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:09,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:09,090 INFO L87 Difference]: Start difference. First operand 864 states and 1582 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:11,619 INFO L93 Difference]: Finished difference Result 2368 states and 4455 transitions. [2025-03-03 16:16:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:11,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-03 16:16:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:11,625 INFO L225 Difference]: With dead ends: 2368 [2025-03-03 16:16:11,625 INFO L226 Difference]: Without dead ends: 1615 [2025-03-03 16:16:11,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:11,627 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 931 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:11,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 571 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 16:16:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-03-03 16:16:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2025-03-03 16:16:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.6174829510229387) internal successors, (2609), 1614 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2609 transitions. [2025-03-03 16:16:11,657 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2609 transitions. Word has length 30 [2025-03-03 16:16:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:11,657 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2609 transitions. [2025-03-03 16:16:11,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2609 transitions. [2025-03-03 16:16:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:16:11,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:11,660 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-03 16:16:11,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:16:11,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:11,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1769088500, now seen corresponding path program 1 times [2025-03-03 16:16:11,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:11,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075862845] [2025-03-03 16:16:11,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:11,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:11,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:16:11,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:16:11,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:11,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075862845] [2025-03-03 16:16:11,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075862845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:11,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:11,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:11,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585728172] [2025-03-03 16:16:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:11,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:11,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:11,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:11,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:11,881 INFO L87 Difference]: Start difference. First operand 1615 states and 2609 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-03 16:16:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:12,209 INFO L93 Difference]: Finished difference Result 2371 states and 3827 transitions. [2025-03-03 16:16:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:16:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-03 16:16:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:12,218 INFO L225 Difference]: With dead ends: 2371 [2025-03-03 16:16:12,218 INFO L226 Difference]: Without dead ends: 2317 [2025-03-03 16:16:12,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:16:12,221 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 11431 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11431 SdHoareTripleChecker+Valid, 5337 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:12,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11431 Valid, 5337 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:16:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-03-03 16:16:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1667. [2025-03-03 16:16:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.6174174174174174) internal successors, (2693), 1666 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2693 transitions. [2025-03-03 16:16:12,260 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2693 transitions. Word has length 77 [2025-03-03 16:16:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:12,261 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2693 transitions. [2025-03-03 16:16:12,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-03 16:16:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2693 transitions. [2025-03-03 16:16:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:16:12,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:12,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:12,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:16:12,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:12,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1833353959, now seen corresponding path program 1 times [2025-03-03 16:16:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612379109] [2025-03-03 16:16:12,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:12,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:16:12,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:16:12,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612379109] [2025-03-03 16:16:12,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612379109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:12,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:12,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:12,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177018508] [2025-03-03 16:16:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:12,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:12,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:12,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:12,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:12,365 INFO L87 Difference]: Start difference. First operand 1667 states and 2693 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:12,395 INFO L93 Difference]: Finished difference Result 1868 states and 3016 transitions. [2025-03-03 16:16:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:12,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 16:16:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:12,401 INFO L225 Difference]: With dead ends: 1868 [2025-03-03 16:16:12,401 INFO L226 Difference]: Without dead ends: 1762 [2025-03-03 16:16:12,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:12,403 INFO L435 NwaCegarLoop]: 1580 mSDtfsCounter, 1498 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1662 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-03 16:16:12,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1662 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-03-03 16:16:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2025-03-03 16:16:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.6160409556313993) internal successors, (2841), 1759 states have internal predecessors, (2841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2841 transitions. [2025-03-03 16:16:12,432 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2841 transitions. Word has length 79 [2025-03-03 16:16:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:12,433 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2841 transitions. [2025-03-03 16:16:12,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2841 transitions. [2025-03-03 16:16:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:16:12,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:12,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:12,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:16:12,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:12,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:12,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1865677194, now seen corresponding path program 1 times [2025-03-03 16:16:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:12,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348470987] [2025-03-03 16:16:12,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:12,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:16:12,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:16:12,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:12,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:12,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:12,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348470987] [2025-03-03 16:16:12,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348470987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:12,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:12,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:12,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464568519] [2025-03-03 16:16:12,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:12,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:12,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:12,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:12,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:12,831 INFO L87 Difference]: Start difference. First operand 1760 states and 2841 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:13,133 INFO L93 Difference]: Finished difference Result 1961 states and 3161 transitions. [2025-03-03 16:16:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:16:13,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 16:16:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:13,140 INFO L225 Difference]: With dead ends: 1961 [2025-03-03 16:16:13,140 INFO L226 Difference]: Without dead ends: 1762 [2025-03-03 16:16:13,141 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-03 16:16:13,142 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 3058 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3058 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:13,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3058 Valid, 2083 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:16:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-03-03 16:16:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2025-03-03 16:16:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.6149032992036405) internal successors, (2839), 1759 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2839 transitions. [2025-03-03 16:16:13,176 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2839 transitions. Word has length 79 [2025-03-03 16:16:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:13,177 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2839 transitions. [2025-03-03 16:16:13,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2839 transitions. [2025-03-03 16:16:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 16:16:13,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:13,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:13,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:16:13,178 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:13,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:13,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2031955900, now seen corresponding path program 1 times [2025-03-03 16:16:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:13,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937207487] [2025-03-03 16:16:13,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:13,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:13,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 16:16:13,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 16:16:13,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:13,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:13,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937207487] [2025-03-03 16:16:13,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937207487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:13,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:13,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:16:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612249019] [2025-03-03 16:16:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:13,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:16:13,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:13,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:16:13,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:16:13,398 INFO L87 Difference]: Start difference. First operand 1760 states and 2839 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:13,449 INFO L93 Difference]: Finished difference Result 1768 states and 2848 transitions. [2025-03-03 16:16:13,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:16:13,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 16:16:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:13,454 INFO L225 Difference]: With dead ends: 1768 [2025-03-03 16:16:13,454 INFO L226 Difference]: Without dead ends: 1766 [2025-03-03 16:16:13,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:16:13,455 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 0 mSDsluCounter, 9443 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11019 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:13,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11019 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-03-03 16:16:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2025-03-03 16:16:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.6122448979591837) internal successors, (2844), 1765 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2844 transitions. [2025-03-03 16:16:13,483 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2844 transitions. Word has length 80 [2025-03-03 16:16:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:13,483 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2844 transitions. [2025-03-03 16:16:13,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2844 transitions. [2025-03-03 16:16:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:16:13,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:13,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:13,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:16:13,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:13,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash 425497576, now seen corresponding path program 1 times [2025-03-03 16:16:13,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:13,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721347289] [2025-03-03 16:16:13,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:13,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:13,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:16:13,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:16:13,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:13,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:13,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721347289] [2025-03-03 16:16:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721347289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:13,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:13,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:13,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951157919] [2025-03-03 16:16:13,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:13,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:13,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:13,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:13,542 INFO L87 Difference]: Start difference. First operand 1766 states and 2844 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:13,615 INFO L93 Difference]: Finished difference Result 1984 states and 3185 transitions. [2025-03-03 16:16:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:13,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:16:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:13,623 INFO L225 Difference]: With dead ends: 1984 [2025-03-03 16:16:13,623 INFO L226 Difference]: Without dead ends: 1872 [2025-03-03 16:16:13,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:13,625 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1742 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-03 16:16:13,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-03-03 16:16:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1870. [2025-03-03 16:16:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1868 states have (on average 1.6086723768736617) internal successors, (3005), 1869 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 3005 transitions. [2025-03-03 16:16:13,666 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 3005 transitions. Word has length 81 [2025-03-03 16:16:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:13,667 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 3005 transitions. [2025-03-03 16:16:13,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 3005 transitions. [2025-03-03 16:16:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:16:13,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:13,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:13,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:16:13,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1894061912, now seen corresponding path program 1 times [2025-03-03 16:16:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:13,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88295046] [2025-03-03 16:16:13,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:13,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:16:13,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:16:13,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:13,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:13,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:13,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88295046] [2025-03-03 16:16:13,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88295046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:13,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:13,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:13,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230178228] [2025-03-03 16:16:13,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:13,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:13,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:13,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:13,725 INFO L87 Difference]: Start difference. First operand 1870 states and 3005 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:13,753 INFO L93 Difference]: Finished difference Result 2460 states and 3925 transitions. [2025-03-03 16:16:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:13,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:16:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:13,759 INFO L225 Difference]: With dead ends: 2460 [2025-03-03 16:16:13,759 INFO L226 Difference]: Without dead ends: 2153 [2025-03-03 16:16:13,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:13,761 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 1514 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1748 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-03 16:16:13,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-03-03 16:16:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2151. [2025-03-03 16:16:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 2149 states have (on average 1.5993485342019544) internal successors, (3437), 2150 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3437 transitions. [2025-03-03 16:16:13,800 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3437 transitions. Word has length 81 [2025-03-03 16:16:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:13,800 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3437 transitions. [2025-03-03 16:16:13,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3437 transitions. [2025-03-03 16:16:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:16:13,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:13,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:13,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:16:13,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:13,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:13,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2048430744, now seen corresponding path program 1 times [2025-03-03 16:16:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:13,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765811761] [2025-03-03 16:16:13,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:13,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:16:13,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:16:13,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:13,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:13,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:13,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765811761] [2025-03-03 16:16:13,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765811761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:13,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:13,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:13,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421525839] [2025-03-03 16:16:13,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:13,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:13,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:13,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:13,852 INFO L87 Difference]: Start difference. First operand 2151 states and 3437 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:13,882 INFO L93 Difference]: Finished difference Result 3279 states and 5179 transitions. [2025-03-03 16:16:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:13,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:16:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:13,889 INFO L225 Difference]: With dead ends: 3279 [2025-03-03 16:16:13,889 INFO L226 Difference]: Without dead ends: 2691 [2025-03-03 16:16:13,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:13,890 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 1512 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1750 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-03 16:16:13,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1750 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2025-03-03 16:16:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2689. [2025-03-03 16:16:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2687 states have (on average 1.582806103461109) internal successors, (4253), 2688 states have internal predecessors, (4253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4253 transitions. [2025-03-03 16:16:13,937 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4253 transitions. Word has length 81 [2025-03-03 16:16:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:13,937 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 4253 transitions. [2025-03-03 16:16:13,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4253 transitions. [2025-03-03 16:16:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:16:13,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:13,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:13,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:16:13,939 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:13,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:13,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1267606056, now seen corresponding path program 1 times [2025-03-03 16:16:13,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:13,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493503811] [2025-03-03 16:16:13,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:13,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:13,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:16:13,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:16:13,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:13,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:13,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493503811] [2025-03-03 16:16:13,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493503811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:13,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:13,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688762115] [2025-03-03 16:16:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:13,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:13,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:13,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:13,989 INFO L87 Difference]: Start difference. First operand 2689 states and 4253 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:14,025 INFO L93 Difference]: Finished difference Result 4845 states and 7543 transitions. [2025-03-03 16:16:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:14,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:16:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:14,035 INFO L225 Difference]: With dead ends: 4845 [2025-03-03 16:16:14,035 INFO L226 Difference]: Without dead ends: 3719 [2025-03-03 16:16:14,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:14,037 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1510 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1752 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-03 16:16:14,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1752 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-03-03 16:16:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3717. [2025-03-03 16:16:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 3715 states have (on average 1.5582772543741588) internal successors, (5789), 3716 states have internal predecessors, (5789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 5789 transitions. [2025-03-03 16:16:14,099 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 5789 transitions. Word has length 81 [2025-03-03 16:16:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:14,099 INFO L471 AbstractCegarLoop]: Abstraction has 3717 states and 5789 transitions. [2025-03-03 16:16:14,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5789 transitions. [2025-03-03 16:16:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:16:14,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:14,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:14,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:16:14,100 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:14,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash 819660520, now seen corresponding path program 1 times [2025-03-03 16:16:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:14,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785192509] [2025-03-03 16:16:14,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:14,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:14,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:16:14,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:16:14,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:14,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:14,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:14,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785192509] [2025-03-03 16:16:14,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785192509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:14,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:14,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185245676] [2025-03-03 16:16:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:14,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:14,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:14,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:14,176 INFO L87 Difference]: Start difference. First operand 3717 states and 5789 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:14,230 INFO L93 Difference]: Finished difference Result 7833 states and 11983 transitions. [2025-03-03 16:16:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:14,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:16:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:14,255 INFO L225 Difference]: With dead ends: 7833 [2025-03-03 16:16:14,255 INFO L226 Difference]: Without dead ends: 5679 [2025-03-03 16:16:14,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:14,263 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1508 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1754 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-03 16:16:14,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1754 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2025-03-03 16:16:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 5677. [2025-03-03 16:16:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 5675 states have (on average 1.5275770925110133) internal successors, (8669), 5676 states have internal predecessors, (8669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 8669 transitions. [2025-03-03 16:16:14,380 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 8669 transitions. Word has length 81 [2025-03-03 16:16:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:14,380 INFO L471 AbstractCegarLoop]: Abstraction has 5677 states and 8669 transitions. [2025-03-03 16:16:14,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 8669 transitions. [2025-03-03 16:16:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:16:14,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:14,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:14,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:16:14,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:14,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1234836392, now seen corresponding path program 1 times [2025-03-03 16:16:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077404844] [2025-03-03 16:16:14,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:14,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:16:14,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:16:14,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:14,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077404844] [2025-03-03 16:16:14,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077404844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:14,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127594225] [2025-03-03 16:16:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:14,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:14,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:14,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:14,438 INFO L87 Difference]: Start difference. First operand 5677 states and 8669 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:14,527 INFO L93 Difference]: Finished difference Result 13521 states and 20287 transitions. [2025-03-03 16:16:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:14,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:16:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:14,545 INFO L225 Difference]: With dead ends: 13521 [2025-03-03 16:16:14,545 INFO L226 Difference]: Without dead ends: 9407 [2025-03-03 16:16:14,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:14,552 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1506 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1756 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-03 16:16:14,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1756 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9407 states. [2025-03-03 16:16:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9407 to 9405. [2025-03-03 16:16:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9405 states, 9403 states have (on average 1.493672232266298) internal successors, (14045), 9404 states have internal predecessors, (14045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9405 states to 9405 states and 14045 transitions. [2025-03-03 16:16:14,951 INFO L78 Accepts]: Start accepts. Automaton has 9405 states and 14045 transitions. Word has length 81 [2025-03-03 16:16:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:14,952 INFO L471 AbstractCegarLoop]: Abstraction has 9405 states and 14045 transitions. [2025-03-03 16:16:14,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 9405 states and 14045 transitions. [2025-03-03 16:16:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:16:14,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:14,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:14,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:16:14,953 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash 748118120, now seen corresponding path program 1 times [2025-03-03 16:16:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765524534] [2025-03-03 16:16:14,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:14,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:16:14,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:16:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:15,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765524534] [2025-03-03 16:16:15,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765524534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:15,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438364745] [2025-03-03 16:16:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:15,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:15,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:15,002 INFO L87 Difference]: Start difference. First operand 9405 states and 14045 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:15,146 INFO L93 Difference]: Finished difference Result 24321 states and 35743 transitions. [2025-03-03 16:16:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:15,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:16:15,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:15,224 INFO L225 Difference]: With dead ends: 24321 [2025-03-03 16:16:15,224 INFO L226 Difference]: Without dead ends: 16479 [2025-03-03 16:16:15,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:15,231 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1504 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1758 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-03 16:16:15,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1758 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16479 states. [2025-03-03 16:16:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16479 to 16477. [2025-03-03 16:16:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16477 states, 16475 states have (on average 1.4585128983308042) internal successors, (24029), 16476 states have internal predecessors, (24029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16477 states to 16477 states and 24029 transitions. [2025-03-03 16:16:15,517 INFO L78 Accepts]: Start accepts. Automaton has 16477 states and 24029 transitions. Word has length 81 [2025-03-03 16:16:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:15,518 INFO L471 AbstractCegarLoop]: Abstraction has 16477 states and 24029 transitions. [2025-03-03 16:16:15,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 16477 states and 24029 transitions. [2025-03-03 16:16:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 16:16:15,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:15,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:15,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:16:15,521 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:15,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:15,521 INFO L85 PathProgramCache]: Analyzing trace with hash -591759982, now seen corresponding path program 1 times [2025-03-03 16:16:15,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:15,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171449934] [2025-03-03 16:16:15,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:15,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:15,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:16:15,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:16:15,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:15,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 16:16:15,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:15,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171449934] [2025-03-03 16:16:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171449934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:15,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:15,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:16:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543936429] [2025-03-03 16:16:15,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:15,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:15,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:15,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:15,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:15,585 INFO L87 Difference]: Start difference. First operand 16477 states and 24029 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 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-03 16:16:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:18,163 INFO L93 Difference]: Finished difference Result 19483 states and 28956 transitions. [2025-03-03 16:16:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:18,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 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 101 [2025-03-03 16:16:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:18,192 INFO L225 Difference]: With dead ends: 19483 [2025-03-03 16:16:18,193 INFO L226 Difference]: Without dead ends: 17979 [2025-03-03 16:16:18,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:18,198 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 868 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:18,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 618 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 16:16:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17979 states. [2025-03-03 16:16:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17979 to 17979. [2025-03-03 16:16:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17979 states, 17977 states have (on average 1.4378928631028536) internal successors, (25849), 17978 states have internal predecessors, (25849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17979 states to 17979 states and 25849 transitions. [2025-03-03 16:16:18,518 INFO L78 Accepts]: Start accepts. Automaton has 17979 states and 25849 transitions. Word has length 101 [2025-03-03 16:16:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:18,518 INFO L471 AbstractCegarLoop]: Abstraction has 17979 states and 25849 transitions. [2025-03-03 16:16:18,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 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-03 16:16:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 17979 states and 25849 transitions. [2025-03-03 16:16:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:16:18,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:18,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:18,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:16:18,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:18,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1592050071, now seen corresponding path program 1 times [2025-03-03 16:16:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556358261] [2025-03-03 16:16:18,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:18,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:16:18,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:16:18,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:18,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:16:18,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:18,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556358261] [2025-03-03 16:16:18,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556358261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:18,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473976861] [2025-03-03 16:16:18,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:18,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:18,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:18,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:18,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:18,707 INFO L87 Difference]: Start difference. First operand 17979 states and 25849 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:20,260 INFO L93 Difference]: Finished difference Result 121035 states and 174337 transitions. [2025-03-03 16:16:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:16:20,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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 104 [2025-03-03 16:16:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:20,439 INFO L225 Difference]: With dead ends: 121035 [2025-03-03 16:16:20,439 INFO L226 Difference]: Without dead ends: 110537 [2025-03-03 16:16:20,461 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-03 16:16:20,462 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 9795 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9795 SdHoareTripleChecker+Valid, 4776 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:20,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9795 Valid, 4776 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:16:20,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110537 states. [2025-03-03 16:16:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110537 to 30715. [2025-03-03 16:16:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30715 states, 30713 states have (on average 1.4334320971575554) internal successors, (44025), 30714 states have internal predecessors, (44025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30715 states to 30715 states and 44025 transitions. [2025-03-03 16:16:21,621 INFO L78 Accepts]: Start accepts. Automaton has 30715 states and 44025 transitions. Word has length 104 [2025-03-03 16:16:21,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:21,621 INFO L471 AbstractCegarLoop]: Abstraction has 30715 states and 44025 transitions. [2025-03-03 16:16:21,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 30715 states and 44025 transitions. [2025-03-03 16:16:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:16:21,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:21,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:21,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:16:21,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:21,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash 383357737, now seen corresponding path program 1 times [2025-03-03 16:16:21,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:21,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374461995] [2025-03-03 16:16:21,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:21,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:16:21,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:16:21,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:21,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:16:21,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:21,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374461995] [2025-03-03 16:16:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374461995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:21,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856936033] [2025-03-03 16:16:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:21,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:21,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:21,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:21,799 INFO L87 Difference]: Start difference. First operand 30715 states and 44025 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:23,774 INFO L93 Difference]: Finished difference Result 135947 states and 195713 transitions. [2025-03-03 16:16:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:16:23,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 104 [2025-03-03 16:16:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:23,942 INFO L225 Difference]: With dead ends: 135947 [2025-03-03 16:16:23,943 INFO L226 Difference]: Without dead ends: 121033 [2025-03-03 16:16:23,976 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-03 16:16:23,977 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 9797 mSDsluCounter, 3062 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9797 SdHoareTripleChecker+Valid, 4731 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:23,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9797 Valid, 4731 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:16:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121033 states. [2025-03-03 16:16:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121033 to 50875. [2025-03-03 16:16:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50875 states, 50873 states have (on average 1.4302478721522223) internal successors, (72761), 50874 states have internal predecessors, (72761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50875 states to 50875 states and 72761 transitions. [2025-03-03 16:16:25,344 INFO L78 Accepts]: Start accepts. Automaton has 50875 states and 72761 transitions. Word has length 104 [2025-03-03 16:16:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:25,344 INFO L471 AbstractCegarLoop]: Abstraction has 50875 states and 72761 transitions. [2025-03-03 16:16:25,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 50875 states and 72761 transitions. [2025-03-03 16:16:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:16:25,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:25,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:25,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:16:25,351 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:25,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash 228988905, now seen corresponding path program 1 times [2025-03-03 16:16:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:25,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899134536] [2025-03-03 16:16:25,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:25,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:25,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:16:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:16:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:16:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:25,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899134536] [2025-03-03 16:16:25,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899134536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:25,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:25,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339640956] [2025-03-03 16:16:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:25,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:25,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:25,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:25,740 INFO L87 Difference]: Start difference. First operand 50875 states and 72761 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-03 16:16:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:28,351 INFO L93 Difference]: Finished difference Result 150859 states and 217025 transitions. [2025-03-03 16:16:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:16:28,351 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 104 [2025-03-03 16:16:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:28,528 INFO L225 Difference]: With dead ends: 150859 [2025-03-03 16:16:28,528 INFO L226 Difference]: Without dead ends: 135945 [2025-03-03 16:16:28,572 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-03 16:16:28,573 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 9817 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9817 SdHoareTripleChecker+Valid, 4693 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:28,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9817 Valid, 4693 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:16:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135945 states. [2025-03-03 16:16:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135945 to 65787. [2025-03-03 16:16:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65787 states, 65785 states have (on average 1.4300068404651516) internal successors, (94073), 65786 states have internal predecessors, (94073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65787 states to 65787 states and 94073 transitions. [2025-03-03 16:16:30,620 INFO L78 Accepts]: Start accepts. Automaton has 65787 states and 94073 transitions. Word has length 104 [2025-03-03 16:16:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:30,620 INFO L471 AbstractCegarLoop]: Abstraction has 65787 states and 94073 transitions. [2025-03-03 16:16:30,620 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-03 16:16:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 65787 states and 94073 transitions. [2025-03-03 16:16:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:16:30,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:30,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:30,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:16:30,626 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -749941591, now seen corresponding path program 1 times [2025-03-03 16:16:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770884247] [2025-03-03 16:16:30,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:30,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:16:30,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:16:30,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:30,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:16:30,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:30,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770884247] [2025-03-03 16:16:30,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770884247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:30,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:30,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740494514] [2025-03-03 16:16:30,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:30,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:30,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:30,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:30,780 INFO L87 Difference]: Start difference. First operand 65787 states and 94073 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-03 16:16:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:33,174 INFO L93 Difference]: Finished difference Result 165771 states and 238337 transitions. [2025-03-03 16:16:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:16:33,175 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 104 [2025-03-03 16:16:33,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:33,364 INFO L225 Difference]: With dead ends: 165771 [2025-03-03 16:16:33,364 INFO L226 Difference]: Without dead ends: 150857 [2025-03-03 16:16:33,413 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-03 16:16:33,413 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 9855 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9855 SdHoareTripleChecker+Valid, 4632 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:33,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9855 Valid, 4632 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:16:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150857 states. [2025-03-03 16:16:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150857 to 80699. [2025-03-03 16:16:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80699 states, 80697 states have (on average 1.4298548892771725) internal successors, (115385), 80698 states have internal predecessors, (115385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80699 states to 80699 states and 115385 transitions. [2025-03-03 16:16:36,294 INFO L78 Accepts]: Start accepts. Automaton has 80699 states and 115385 transitions. Word has length 104 [2025-03-03 16:16:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:36,294 INFO L471 AbstractCegarLoop]: Abstraction has 80699 states and 115385 transitions. [2025-03-03 16:16:36,294 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-03 16:16:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 80699 states and 115385 transitions. [2025-03-03 16:16:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:16:36,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:36,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:16:36,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:36,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1197887127, now seen corresponding path program 1 times [2025-03-03 16:16:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:36,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650490526] [2025-03-03 16:16:36,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:36,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:16:36,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:16:36,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:36,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:16:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:36,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650490526] [2025-03-03 16:16:36,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650490526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:36,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:36,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456452308] [2025-03-03 16:16:36,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:36,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:36,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:36,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:36,495 INFO L87 Difference]: Start difference. First operand 80699 states and 115385 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-03 16:16:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:39,817 INFO L93 Difference]: Finished difference Result 180683 states and 259649 transitions. [2025-03-03 16:16:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:16:39,817 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 104 [2025-03-03 16:16:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:40,029 INFO L225 Difference]: With dead ends: 180683 [2025-03-03 16:16:40,029 INFO L226 Difference]: Without dead ends: 165769 [2025-03-03 16:16:40,089 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-03 16:16:40,091 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9902 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9902 SdHoareTripleChecker+Valid, 4605 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:40,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9902 Valid, 4605 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:16:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165769 states. [2025-03-03 16:16:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165769 to 95611. [2025-03-03 16:16:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95611 states, 95609 states have (on average 1.429750337311341) internal successors, (136697), 95610 states have internal predecessors, (136697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95611 states to 95611 states and 136697 transitions. [2025-03-03 16:16:43,993 INFO L78 Accepts]: Start accepts. Automaton has 95611 states and 136697 transitions. Word has length 104 [2025-03-03 16:16:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:43,993 INFO L471 AbstractCegarLoop]: Abstraction has 95611 states and 136697 transitions. [2025-03-03 16:16:43,993 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-03 16:16:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 95611 states and 136697 transitions. [2025-03-03 16:16:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:16:44,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:44,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:44,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:16:44,000 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:44,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash -782711255, now seen corresponding path program 1 times [2025-03-03 16:16:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:44,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20846449] [2025-03-03 16:16:44,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:44,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:16:44,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:16:44,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:44,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 16:16:44,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:44,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20846449] [2025-03-03 16:16:44,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20846449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:44,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:44,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930912762] [2025-03-03 16:16:44,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:44,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:44,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:44,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:44,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:44,192 INFO L87 Difference]: Start difference. First operand 95611 states and 136697 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-03 16:16:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:47,822 INFO L93 Difference]: Finished difference Result 195595 states and 280961 transitions. [2025-03-03 16:16:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:16:47,822 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 104 [2025-03-03 16:16:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:48,092 INFO L225 Difference]: With dead ends: 195595 [2025-03-03 16:16:48,092 INFO L226 Difference]: Without dead ends: 180681 [2025-03-03 16:16:48,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:16:48,141 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 9960 mSDsluCounter, 2956 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9960 SdHoareTripleChecker+Valid, 4617 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:48,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9960 Valid, 4617 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:16:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180681 states.