./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.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 f64db8798478892c7952ed2e39de053718a88a4933b23364a7fdbf37373a3455 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:26:35,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:26:35,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:26:35,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:26:35,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:26:35,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:26:35,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:26:35,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:26:35,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:26:35,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:26:35,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:26:35,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:26:35,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:26:35,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:26:35,881 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:26:35,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:26:35,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:26:35,881 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:26:35,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:26:35,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:26:35,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:26:35,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:26:35,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:26:35,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:26:35,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:26:35,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:26:35,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:26:35,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:26:35,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:26:35,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:26:35,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:26:35,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:26:35,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:26:35,884 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 -> f64db8798478892c7952ed2e39de053718a88a4933b23364a7fdbf37373a3455 [2025-03-16 20:26:36,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:26:36,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:26:36,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:26:36,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:26:36,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:26:36,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-16 20:26:37,191 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8d08dd8/f8fa669dcc1a4bcb98a5f19fbb30f885/FLAG1975c089e [2025-03-16 20:26:37,641 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:26:37,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-16 20:26:37,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8d08dd8/f8fa669dcc1a4bcb98a5f19fbb30f885/FLAG1975c089e [2025-03-16 20:26:37,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8d08dd8/f8fa669dcc1a4bcb98a5f19fbb30f885 [2025-03-16 20:26:37,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:26:37,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:26:37,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:26:37,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:26:37,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:26:37,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:26:37" (1/1) ... [2025-03-16 20:26:37,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f238481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:37, skipping insertion in model container [2025-03-16 20:26:37,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:26:37" (1/1) ... [2025-03-16 20:26:37,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:26:38,056 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.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c[11705,11718] [2025-03-16 20:26:38,102 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.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c[18995,19008] [2025-03-16 20:26:38,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:26:38,480 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:26:38,506 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.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c[11705,11718] [2025-03-16 20:26:38,518 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.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c[18995,19008] [2025-03-16 20:26:38,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:26:38,758 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:26:38,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38 WrapperNode [2025-03-16 20:26:38,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:26:38,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:26:38,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:26:38,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:26:38,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:38,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,075 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5092 [2025-03-16 20:26:39,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:26:39,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:26:39,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:26:39,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:26:39,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,271 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:26:39,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:26:39,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:26:39,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:26:39,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:26:39,462 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (1/1) ... [2025-03-16 20:26:39,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:26:39,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:39,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:26:39,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:26:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:26:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:26:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:26:39,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:26:39,588 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:26:39,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:26:42,794 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3610: havoc calculate_output2_#t~ret38#1; [2025-03-16 20:26:42,795 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5100: havoc calculate_output3_#t~ret39#1; [2025-03-16 20:26:42,795 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2131: havoc calculate_output_#t~ret37#1; [2025-03-16 20:26:42,932 INFO L? ?]: Removed 740 outVars from TransFormulas that were not future-live. [2025-03-16 20:26:42,932 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:26:42,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:26:42,961 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:26:42,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:26:42 BoogieIcfgContainer [2025-03-16 20:26:42,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:26:42,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:26:42,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:26:42,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:26:42,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:26:37" (1/3) ... [2025-03-16 20:26:42,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6934e62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:26:42, skipping insertion in model container [2025-03-16 20:26:42,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:38" (2/3) ... [2025-03-16 20:26:42,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6934e62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:26:42, skipping insertion in model container [2025-03-16 20:26:42,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:26:42" (3/3) ... [2025-03-16 20:26:42,971 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-16 20:26:42,983 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:26:42,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c that has 1 procedures, 836 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:26:43,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:26:43,055 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;@58d2abf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:26:43,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:26:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 836 states, 833 states have (on average 1.972388955582233) internal successors, (1643), 835 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:26:43,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:43,065 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] [2025-03-16 20:26:43,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:43,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash -264315576, now seen corresponding path program 1 times [2025-03-16 20:26:43,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:43,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736461026] [2025-03-16 20:26:43,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:43,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:43,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:26:43,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:26:43,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:43,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736461026] [2025-03-16 20:26:43,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736461026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:43,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:43,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:26:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587468099] [2025-03-16 20:26:43,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:43,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:26:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:43,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:26:43,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:26:43,294 INFO L87 Difference]: Start difference. First operand has 836 states, 833 states have (on average 1.972388955582233) internal successors, (1643), 835 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:43,368 INFO L93 Difference]: Finished difference Result 1637 states and 3218 transitions. [2025-03-16 20:26:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:26:43,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-16 20:26:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:43,379 INFO L225 Difference]: With dead ends: 1637 [2025-03-16 20:26:43,379 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:26:43,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:26:43,390 INFO L435 NwaCegarLoop]: 1578 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, 1578 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:43,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:26:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-16 20:26:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8963855421686746) internal successors, (1574), 831 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1574 transitions. [2025-03-16 20:26:43,471 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1574 transitions. Word has length 21 [2025-03-16 20:26:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:43,472 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1574 transitions. [2025-03-16 20:26:43,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1574 transitions. [2025-03-16 20:26:43,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:26:43,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:43,473 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] [2025-03-16 20:26:43,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:26:43,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:43,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1088994121, now seen corresponding path program 1 times [2025-03-16 20:26:43,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:43,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708977302] [2025-03-16 20:26:43,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:43,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:26:43,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:26:43,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:43,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708977302] [2025-03-16 20:26:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708977302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:26:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929784066] [2025-03-16 20:26:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:26:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:43,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:26:43,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:26:43,665 INFO L87 Difference]: Start difference. First operand 832 states and 1574 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:43,787 INFO L93 Difference]: Finished difference Result 878 states and 1646 transitions. [2025-03-16 20:26:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:26:43,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-16 20:26:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:43,792 INFO L225 Difference]: With dead ends: 878 [2025-03-16 20:26:43,793 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:26:43,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:26:43,794 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 0 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4684 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:43,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4684 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:26:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:26:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-16 20:26:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8590361445783132) internal successors, (1543), 831 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1543 transitions. [2025-03-16 20:26:43,822 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1543 transitions. Word has length 21 [2025-03-16 20:26:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:43,822 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1543 transitions. [2025-03-16 20:26:43,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1543 transitions. [2025-03-16 20:26:43,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:26:43,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:43,823 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] [2025-03-16 20:26:43,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:26:43,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:43,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:43,827 INFO L85 PathProgramCache]: Analyzing trace with hash -586643669, now seen corresponding path program 1 times [2025-03-16 20:26:43,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:43,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868819208] [2025-03-16 20:26:43,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:43,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:26:43,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:26:43,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:43,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:44,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868819208] [2025-03-16 20:26:44,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868819208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:44,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:44,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:26:44,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561743577] [2025-03-16 20:26:44,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:44,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:26:44,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:44,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:26:44,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:26:44,016 INFO L87 Difference]: Start difference. First operand 832 states and 1543 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:44,202 INFO L93 Difference]: Finished difference Result 1262 states and 2233 transitions. [2025-03-16 20:26:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:26:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 20:26:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:44,208 INFO L225 Difference]: With dead ends: 1262 [2025-03-16 20:26:44,208 INFO L226 Difference]: Without dead ends: 1219 [2025-03-16 20:26:44,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:26:44,209 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 8015 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8015 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:44,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8015 Valid, 2520 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:26:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-16 20:26:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 873. [2025-03-16 20:26:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1609 transitions. [2025-03-16 20:26:44,237 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1609 transitions. Word has length 51 [2025-03-16 20:26:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:44,237 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1609 transitions. [2025-03-16 20:26:44,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1609 transitions. [2025-03-16 20:26:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:26:44,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:44,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:44,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:26:44,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:44,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:44,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1086667923, now seen corresponding path program 1 times [2025-03-16 20:26:44,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:44,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493322234] [2025-03-16 20:26:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:44,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:26:44,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:26:44,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:44,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:44,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:44,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493322234] [2025-03-16 20:26:44,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493322234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:44,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:44,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:26:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600623923] [2025-03-16 20:26:44,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:44,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:26:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:44,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:26:44,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:26:44,535 INFO L87 Difference]: Start difference. First operand 873 states and 1609 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:44,680 INFO L93 Difference]: Finished difference Result 959 states and 1745 transitions. [2025-03-16 20:26:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:26:44,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 20:26:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:44,684 INFO L225 Difference]: With dead ends: 959 [2025-03-16 20:26:44,684 INFO L226 Difference]: Without dead ends: 875 [2025-03-16 20:26:44,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:26:44,686 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 5968 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5968 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:44,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5968 Valid, 1800 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-16 20:26:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2025-03-16 20:26:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8461538461538463) internal successors, (1608), 872 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1608 transitions. [2025-03-16 20:26:44,705 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1608 transitions. Word has length 53 [2025-03-16 20:26:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:44,706 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1608 transitions. [2025-03-16 20:26:44,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1608 transitions. [2025-03-16 20:26:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:26:44,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:44,710 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] [2025-03-16 20:26:44,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:26:44,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1087710608, now seen corresponding path program 1 times [2025-03-16 20:26:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:44,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537710670] [2025-03-16 20:26:44,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:44,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:26:44,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:26:44,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:44,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:44,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:44,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537710670] [2025-03-16 20:26:44,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537710670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:44,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:44,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60429872] [2025-03-16 20:26:44,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:44,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:44,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:44,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:44,792 INFO L87 Difference]: Start difference. First operand 873 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:44,819 INFO L93 Difference]: Finished difference Result 1030 states and 1857 transitions. [2025-03-16 20:26:44,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:44,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 20:26:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:44,823 INFO L225 Difference]: With dead ends: 1030 [2025-03-16 20:26:44,824 INFO L226 Difference]: Without dead ends: 946 [2025-03-16 20:26:44,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:44,825 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:44,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1601 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-16 20:26:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 942. [2025-03-16 20:26:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.824468085106383) internal successors, (1715), 941 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1715 transitions. [2025-03-16 20:26:44,844 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1715 transitions. Word has length 53 [2025-03-16 20:26:44,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:44,845 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1715 transitions. [2025-03-16 20:26:44,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1715 transitions. [2025-03-16 20:26:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 20:26:44,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:44,846 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] [2025-03-16 20:26:44,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:26:44,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:44,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:44,847 INFO L85 PathProgramCache]: Analyzing trace with hash 674017815, now seen corresponding path program 1 times [2025-03-16 20:26:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:44,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797018171] [2025-03-16 20:26:44,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:44,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:44,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 20:26:44,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 20:26:44,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:44,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:45,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:45,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797018171] [2025-03-16 20:26:45,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797018171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:45,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:45,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:26:45,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683674970] [2025-03-16 20:26:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:45,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:26:45,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:45,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:26:45,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:26:45,054 INFO L87 Difference]: Start difference. First operand 942 states and 1715 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:45,093 INFO L93 Difference]: Finished difference Result 948 states and 1722 transitions. [2025-03-16 20:26:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:26:45,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-16 20:26:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:45,097 INFO L225 Difference]: With dead ends: 948 [2025-03-16 20:26:45,097 INFO L226 Difference]: Without dead ends: 946 [2025-03-16 20:26:45,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:26:45,128 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 0 mSDsluCounter, 6145 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7684 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:45,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7684 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-16 20:26:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2025-03-16 20:26:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 944 states have (on average 1.819915254237288) internal successors, (1718), 945 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1718 transitions. [2025-03-16 20:26:45,150 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1718 transitions. Word has length 54 [2025-03-16 20:26:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:45,150 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1718 transitions. [2025-03-16 20:26:45,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1718 transitions. [2025-03-16 20:26:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:26:45,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:45,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:45,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:26:45,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:45,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash 232477583, now seen corresponding path program 1 times [2025-03-16 20:26:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:45,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954531364] [2025-03-16 20:26:45,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:45,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:26:45,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:26:45,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:45,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:45,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:45,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954531364] [2025-03-16 20:26:45,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954531364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:45,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:45,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:45,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938836471] [2025-03-16 20:26:45,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:45,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:45,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:45,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:45,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,210 INFO L87 Difference]: Start difference. First operand 946 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:45,230 INFO L93 Difference]: Finished difference Result 1244 states and 2178 transitions. [2025-03-16 20:26:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:45,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:26:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:45,235 INFO L225 Difference]: With dead ends: 1244 [2025-03-16 20:26:45,235 INFO L226 Difference]: Without dead ends: 1087 [2025-03-16 20:26:45,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,236 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1495 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:45,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-03-16 20:26:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1085. [2025-03-16 20:26:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1083 states have (on average 1.7811634349030472) internal successors, (1929), 1084 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1929 transitions. [2025-03-16 20:26:45,255 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1929 transitions. Word has length 55 [2025-03-16 20:26:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:45,255 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1929 transitions. [2025-03-16 20:26:45,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1929 transitions. [2025-03-16 20:26:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:26:45,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:45,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:45,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:26:45,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:45,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash 989518223, now seen corresponding path program 1 times [2025-03-16 20:26:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:45,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993412981] [2025-03-16 20:26:45,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:45,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:45,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:26:45,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:26:45,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:45,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993412981] [2025-03-16 20:26:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993412981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:45,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:45,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370592361] [2025-03-16 20:26:45,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:45,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:45,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:45,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,309 INFO L87 Difference]: Start difference. First operand 1085 states and 1929 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:45,332 INFO L93 Difference]: Finished difference Result 1645 states and 2783 transitions. [2025-03-16 20:26:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:45,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:26:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:45,337 INFO L225 Difference]: With dead ends: 1645 [2025-03-16 20:26:45,337 INFO L226 Difference]: Without dead ends: 1349 [2025-03-16 20:26:45,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,338 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 1491 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:45,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1659 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-03-16 20:26:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1347. [2025-03-16 20:26:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1345 states have (on average 1.7241635687732342) internal successors, (2319), 1346 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2319 transitions. [2025-03-16 20:26:45,362 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2319 transitions. Word has length 55 [2025-03-16 20:26:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:45,363 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 2319 transitions. [2025-03-16 20:26:45,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2319 transitions. [2025-03-16 20:26:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:26:45,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:45,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:45,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:26:45,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:45,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash 439729295, now seen corresponding path program 1 times [2025-03-16 20:26:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:45,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066615758] [2025-03-16 20:26:45,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:45,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:26:45,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:26:45,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:45,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:45,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066615758] [2025-03-16 20:26:45,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066615758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:45,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:45,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:45,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781563487] [2025-03-16 20:26:45,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:45,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:45,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:45,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:45,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,409 INFO L87 Difference]: Start difference. First operand 1347 states and 2319 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:45,435 INFO L93 Difference]: Finished difference Result 2399 states and 3897 transitions. [2025-03-16 20:26:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:45,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:26:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:45,441 INFO L225 Difference]: With dead ends: 2399 [2025-03-16 20:26:45,441 INFO L226 Difference]: Without dead ends: 1841 [2025-03-16 20:26:45,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,442 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 1489 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:45,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1661 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2025-03-16 20:26:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1839. [2025-03-16 20:26:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1837 states have (on average 1.6521502449646162) internal successors, (3035), 1838 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 3035 transitions. [2025-03-16 20:26:45,475 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 3035 transitions. Word has length 55 [2025-03-16 20:26:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:45,475 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 3035 transitions. [2025-03-16 20:26:45,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 3035 transitions. [2025-03-16 20:26:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:26:45,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:45,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:45,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:26:45,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:45,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1055700623, now seen corresponding path program 1 times [2025-03-16 20:26:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:45,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638889222] [2025-03-16 20:26:45,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:45,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:26:45,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:26:45,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:45,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:45,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:45,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638889222] [2025-03-16 20:26:45,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638889222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:45,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:45,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:45,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178065954] [2025-03-16 20:26:45,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:45,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:45,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:45,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,516 INFO L87 Difference]: Start difference. First operand 1839 states and 3035 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:45,552 INFO L93 Difference]: Finished difference Result 3811 states and 5933 transitions. [2025-03-16 20:26:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:45,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:26:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:45,561 INFO L225 Difference]: With dead ends: 3811 [2025-03-16 20:26:45,561 INFO L226 Difference]: Without dead ends: 2761 [2025-03-16 20:26:45,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,563 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1493 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:45,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1665 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2025-03-16 20:26:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2759. [2025-03-16 20:26:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2759 states, 2757 states have (on average 1.5738121146173376) internal successors, (4339), 2758 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 4339 transitions. [2025-03-16 20:26:45,613 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 4339 transitions. Word has length 55 [2025-03-16 20:26:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:45,613 INFO L471 AbstractCegarLoop]: Abstraction has 2759 states and 4339 transitions. [2025-03-16 20:26:45,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 4339 transitions. [2025-03-16 20:26:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:26:45,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:45,614 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] [2025-03-16 20:26:45,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:26:45,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:45,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash -441912209, now seen corresponding path program 1 times [2025-03-16 20:26:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649606529] [2025-03-16 20:26:45,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:45,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:45,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:26:45,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:26:45,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:45,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:45,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649606529] [2025-03-16 20:26:45,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649606529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:45,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:45,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:45,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167891372] [2025-03-16 20:26:45,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:45,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:45,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:45,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:45,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,651 INFO L87 Difference]: Start difference. First operand 2759 states and 4339 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:45,694 INFO L93 Difference]: Finished difference Result 4814 states and 7385 transitions. [2025-03-16 20:26:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:45,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-16 20:26:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:45,704 INFO L225 Difference]: With dead ends: 4814 [2025-03-16 20:26:45,704 INFO L226 Difference]: Without dead ends: 3691 [2025-03-16 20:26:45,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:45,707 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 1494 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:45,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1664 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2025-03-16 20:26:45,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3689. [2025-03-16 20:26:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3689 states, 3687 states have (on average 1.537564415513968) internal successors, (5669), 3688 states have internal predecessors, (5669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 5669 transitions. [2025-03-16 20:26:45,771 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 5669 transitions. Word has length 57 [2025-03-16 20:26:45,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:45,772 INFO L471 AbstractCegarLoop]: Abstraction has 3689 states and 5669 transitions. [2025-03-16 20:26:45,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 5669 transitions. [2025-03-16 20:26:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:26:45,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:45,772 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] [2025-03-16 20:26:45,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:26:45,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:45,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:45,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1032591194, now seen corresponding path program 1 times [2025-03-16 20:26:45,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:45,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130980406] [2025-03-16 20:26:45,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:45,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:45,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:26:45,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:26:45,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:45,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:45,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130980406] [2025-03-16 20:26:45,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130980406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:45,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:45,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830982568] [2025-03-16 20:26:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:45,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:26:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:45,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:26:45,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:26:45,959 INFO L87 Difference]: Start difference. First operand 3689 states and 5669 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:50,468 INFO L93 Difference]: Finished difference Result 5944 states and 9978 transitions. [2025-03-16 20:26:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:26:50,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 20:26:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:50,484 INFO L225 Difference]: With dead ends: 5944 [2025-03-16 20:26:50,484 INFO L226 Difference]: Without dead ends: 5191 [2025-03-16 20:26:50,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:26:50,487 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 2402 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2402 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:50,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2402 Valid, 815 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 20:26:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2025-03-16 20:26:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 5191. [2025-03-16 20:26:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 5189 states have (on average 1.473308922721141) internal successors, (7645), 5190 states have internal predecessors, (7645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7645 transitions. [2025-03-16 20:26:50,571 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7645 transitions. Word has length 62 [2025-03-16 20:26:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:50,571 INFO L471 AbstractCegarLoop]: Abstraction has 5191 states and 7645 transitions. [2025-03-16 20:26:50,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7645 transitions. [2025-03-16 20:26:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:26:50,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:50,577 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:26:50,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:26:50,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:50,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 289567166, now seen corresponding path program 1 times [2025-03-16 20:26:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:50,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012490361] [2025-03-16 20:26:50,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:50,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:26:50,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:26:50,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:50,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:26:50,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:50,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012490361] [2025-03-16 20:26:50,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012490361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:50,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:50,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:26:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358831630] [2025-03-16 20:26:50,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:50,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:26:50,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:50,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:26:50,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:26:50,695 INFO L87 Difference]: Start difference. First operand 5191 states and 7645 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:51,057 INFO L93 Difference]: Finished difference Result 20291 states and 29459 transitions. [2025-03-16 20:26:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:26:51,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 73 [2025-03-16 20:26:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:51,102 INFO L225 Difference]: With dead ends: 20291 [2025-03-16 20:26:51,102 INFO L226 Difference]: Without dead ends: 17393 [2025-03-16 20:26:51,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:26:51,111 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6364 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6364 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:51,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6364 Valid, 3554 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:26:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17393 states. [2025-03-16 20:26:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17393 to 8087. [2025-03-16 20:26:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8087 states, 8085 states have (on average 1.4581323438466296) internal successors, (11789), 8086 states have internal predecessors, (11789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8087 states to 8087 states and 11789 transitions. [2025-03-16 20:26:51,323 INFO L78 Accepts]: Start accepts. Automaton has 8087 states and 11789 transitions. Word has length 73 [2025-03-16 20:26:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:51,323 INFO L471 AbstractCegarLoop]: Abstraction has 8087 states and 11789 transitions. [2025-03-16 20:26:51,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8087 states and 11789 transitions. [2025-03-16 20:26:51,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:26:51,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:51,325 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:26:51,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:26:51,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1046607806, now seen corresponding path program 1 times [2025-03-16 20:26:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:51,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881984008] [2025-03-16 20:26:51,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:51,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:26:51,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:26:51,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:51,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:26:51,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:51,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881984008] [2025-03-16 20:26:51,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881984008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:51,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:51,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:26:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583732438] [2025-03-16 20:26:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:51,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:26:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:51,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:26:51,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:26:51,441 INFO L87 Difference]: Start difference. First operand 8087 states and 11789 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:51,724 INFO L93 Difference]: Finished difference Result 23187 states and 33603 transitions. [2025-03-16 20:26:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:26:51,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 73 [2025-03-16 20:26:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:51,753 INFO L225 Difference]: With dead ends: 23187 [2025-03-16 20:26:51,753 INFO L226 Difference]: Without dead ends: 20289 [2025-03-16 20:26:51,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:26:51,759 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 6414 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6414 SdHoareTripleChecker+Valid, 3507 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:51,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6414 Valid, 3507 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:26:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20289 states. [2025-03-16 20:26:51,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20289 to 12439. [2025-03-16 20:26:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12439 states, 12437 states have (on average 1.444480180107743) internal successors, (17965), 12438 states have internal predecessors, (17965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 17965 transitions. [2025-03-16 20:26:52,056 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 17965 transitions. Word has length 73 [2025-03-16 20:26:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:52,056 INFO L471 AbstractCegarLoop]: Abstraction has 12439 states and 17965 transitions. [2025-03-16 20:26:52,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 17965 transitions. [2025-03-16 20:26:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:26:52,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:52,058 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:26:52,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:26:52,058 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:52,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash 496818878, now seen corresponding path program 1 times [2025-03-16 20:26:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:52,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351584387] [2025-03-16 20:26:52,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:52,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:52,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:26:52,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:26:52,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:52,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:26:52,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351584387] [2025-03-16 20:26:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351584387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:52,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:52,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:26:52,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572013041] [2025-03-16 20:26:52,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:52,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:26:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:52,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:26:52,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:26:52,288 INFO L87 Difference]: Start difference. First operand 12439 states and 17965 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:52,635 INFO L93 Difference]: Finished difference Result 26083 states and 37747 transitions. [2025-03-16 20:26:52,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:26:52,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 73 [2025-03-16 20:26:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:52,666 INFO L225 Difference]: With dead ends: 26083 [2025-03-16 20:26:52,666 INFO L226 Difference]: Without dead ends: 23185 [2025-03-16 20:26:52,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:26:52,673 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6369 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6369 SdHoareTripleChecker+Valid, 3541 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:52,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6369 Valid, 3541 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:26:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23185 states. [2025-03-16 20:26:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23185 to 15335. [2025-03-16 20:26:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15335 states, 15333 states have (on average 1.441922650492402) internal successors, (22109), 15334 states have internal predecessors, (22109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15335 states to 15335 states and 22109 transitions. [2025-03-16 20:26:53,056 INFO L78 Accepts]: Start accepts. Automaton has 15335 states and 22109 transitions. Word has length 73 [2025-03-16 20:26:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:53,056 INFO L471 AbstractCegarLoop]: Abstraction has 15335 states and 22109 transitions. [2025-03-16 20:26:53,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 15335 states and 22109 transitions. [2025-03-16 20:26:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:26:53,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:53,058 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:26:53,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:26:53,058 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1112790206, now seen corresponding path program 1 times [2025-03-16 20:26:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388851087] [2025-03-16 20:26:53,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:53,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:26:53,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:26:53,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:53,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:26:53,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:53,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388851087] [2025-03-16 20:26:53,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388851087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:53,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:53,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:26:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344498391] [2025-03-16 20:26:53,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:53,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:26:53,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:53,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:26:53,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:26:53,193 INFO L87 Difference]: Start difference. First operand 15335 states and 22109 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:53,655 INFO L93 Difference]: Finished difference Result 28979 states and 41891 transitions. [2025-03-16 20:26:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:26:53,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 73 [2025-03-16 20:26:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:53,782 INFO L225 Difference]: With dead ends: 28979 [2025-03-16 20:26:53,783 INFO L226 Difference]: Without dead ends: 26081 [2025-03-16 20:26:53,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:26:53,787 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6321 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6321 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:53,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6321 Valid, 3586 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:26:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26081 states. [2025-03-16 20:26:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26081 to 18231. [2025-03-16 20:26:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18231 states, 18229 states have (on average 1.4401777387678973) internal successors, (26253), 18230 states have internal predecessors, (26253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18231 states to 18231 states and 26253 transitions. [2025-03-16 20:26:54,105 INFO L78 Accepts]: Start accepts. Automaton has 18231 states and 26253 transitions. Word has length 73 [2025-03-16 20:26:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:54,105 INFO L471 AbstractCegarLoop]: Abstraction has 18231 states and 26253 transitions. [2025-03-16 20:26:54,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 18231 states and 26253 transitions. [2025-03-16 20:26:54,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:26:54,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:54,107 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:26:54,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:26:54,108 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:54,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash -861645504, now seen corresponding path program 1 times [2025-03-16 20:26:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518266922] [2025-03-16 20:26:54,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:54,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:26:54,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:26:54,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:54,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:54,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:54,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518266922] [2025-03-16 20:26:54,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518266922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:54,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:54,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:54,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957392559] [2025-03-16 20:26:54,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:54,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:54,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:54,175 INFO L87 Difference]: Start difference. First operand 18231 states and 26253 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:54,401 INFO L93 Difference]: Finished difference Result 29518 states and 42643 transitions. [2025-03-16 20:26:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-16 20:26:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:54,420 INFO L225 Difference]: With dead ends: 29518 [2025-03-16 20:26:54,420 INFO L226 Difference]: Without dead ends: 13580 [2025-03-16 20:26:54,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:54,431 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 50 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:54,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3111 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13580 states. [2025-03-16 20:26:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13580 to 13578. [2025-03-16 20:26:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13578 states, 13576 states have (on average 1.4484384207424867) internal successors, (19664), 13577 states have internal predecessors, (19664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13578 states to 13578 states and 19664 transitions. [2025-03-16 20:26:54,642 INFO L78 Accepts]: Start accepts. Automaton has 13578 states and 19664 transitions. Word has length 75 [2025-03-16 20:26:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:54,643 INFO L471 AbstractCegarLoop]: Abstraction has 13578 states and 19664 transitions. [2025-03-16 20:26:54,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 13578 states and 19664 transitions. [2025-03-16 20:26:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:26:54,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:54,644 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:26:54,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:26:54,644 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:54,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1413397794, now seen corresponding path program 1 times [2025-03-16 20:26:54,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:54,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674424162] [2025-03-16 20:26:54,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:54,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:54,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:26:54,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:26:54,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:54,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:26:54,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674424162] [2025-03-16 20:26:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674424162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:54,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:54,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:26:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063579075] [2025-03-16 20:26:54,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:54,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:26:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:54,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:26:54,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:26:54,738 INFO L87 Difference]: Start difference. First operand 13578 states and 19664 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:55,055 INFO L93 Difference]: Finished difference Result 23830 states and 34550 transitions. [2025-03-16 20:26:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:26:55,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 20:26:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:55,080 INFO L225 Difference]: With dead ends: 23830 [2025-03-16 20:26:55,080 INFO L226 Difference]: Without dead ends: 21780 [2025-03-16 20:26:55,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:26:55,087 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6371 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6371 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:55,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6371 Valid, 3622 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:26:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21780 states. [2025-03-16 20:26:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21780 to 15626. [2025-03-16 20:26:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15626 states, 15624 states have (on average 1.4470046082949308) internal successors, (22608), 15625 states have internal predecessors, (22608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15626 states to 15626 states and 22608 transitions. [2025-03-16 20:26:55,357 INFO L78 Accepts]: Start accepts. Automaton has 15626 states and 22608 transitions. Word has length 75 [2025-03-16 20:26:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:55,358 INFO L471 AbstractCegarLoop]: Abstraction has 15626 states and 22608 transitions. [2025-03-16 20:26:55,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 15626 states and 22608 transitions. [2025-03-16 20:26:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:26:55,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:55,359 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:26:55,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:26:55,359 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:55,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 936423678, now seen corresponding path program 1 times [2025-03-16 20:26:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286229688] [2025-03-16 20:26:55,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:55,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:26:55,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:26:55,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:55,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286229688] [2025-03-16 20:26:55,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286229688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:55,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130721017] [2025-03-16 20:26:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:55,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:55,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:55,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:55,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:55,414 INFO L87 Difference]: Start difference. First operand 15626 states and 22608 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:55,562 INFO L93 Difference]: Finished difference Result 22286 states and 32178 transitions. [2025-03-16 20:26:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:26:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:55,574 INFO L225 Difference]: With dead ends: 22286 [2025-03-16 20:26:55,574 INFO L226 Difference]: Without dead ends: 8972 [2025-03-16 20:26:55,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:55,584 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 45 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:55,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3096 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8972 states. [2025-03-16 20:26:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8972 to 8970. [2025-03-16 20:26:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8970 states, 8968 states have (on average 1.4424620874219447) internal successors, (12936), 8969 states have internal predecessors, (12936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8970 states to 8970 states and 12936 transitions. [2025-03-16 20:26:55,792 INFO L78 Accepts]: Start accepts. Automaton has 8970 states and 12936 transitions. Word has length 76 [2025-03-16 20:26:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:55,792 INFO L471 AbstractCegarLoop]: Abstraction has 8970 states and 12936 transitions. [2025-03-16 20:26:55,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8970 states and 12936 transitions. [2025-03-16 20:26:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:26:55,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:55,793 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:26:55,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:26:55,794 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:55,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1884587529, now seen corresponding path program 1 times [2025-03-16 20:26:55,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915658819] [2025-03-16 20:26:55,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:55,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:26:55,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:26:55,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:55,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:55,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915658819] [2025-03-16 20:26:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915658819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:55,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:55,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335287611] [2025-03-16 20:26:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:55,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:55,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:55,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:55,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:55,870 INFO L87 Difference]: Start difference. First operand 8970 states and 12936 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:55,964 INFO L93 Difference]: Finished difference Result 12302 states and 17670 transitions. [2025-03-16 20:26:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:26:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:55,970 INFO L225 Difference]: With dead ends: 12302 [2025-03-16 20:26:55,970 INFO L226 Difference]: Without dead ends: 5644 [2025-03-16 20:26:55,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:55,976 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 42 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3081 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:55,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3081 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2025-03-16 20:26:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 5642. [2025-03-16 20:26:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5642 states, 5640 states have (on average 1.4453900709219858) internal successors, (8152), 5641 states have internal predecessors, (8152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 8152 transitions. [2025-03-16 20:26:56,099 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 8152 transitions. Word has length 78 [2025-03-16 20:26:56,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:56,099 INFO L471 AbstractCegarLoop]: Abstraction has 5642 states and 8152 transitions. [2025-03-16 20:26:56,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 8152 transitions. [2025-03-16 20:26:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 20:26:56,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:56,101 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:26:56,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:26:56,101 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:56,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1516299760, now seen corresponding path program 1 times [2025-03-16 20:26:56,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:56,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710642522] [2025-03-16 20:26:56,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:56,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:56,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 20:26:56,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 20:26:56,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:56,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:56,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710642522] [2025-03-16 20:26:56,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710642522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:56,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:56,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529339312] [2025-03-16 20:26:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:56,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:56,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:56,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:56,179 INFO L87 Difference]: Start difference. First operand 5642 states and 8152 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-16 20:26:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:56,237 INFO L93 Difference]: Finished difference Result 7310 states and 10494 transitions. [2025-03-16 20:26:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:56,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-16 20:26:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:56,242 INFO L225 Difference]: With dead ends: 7310 [2025-03-16 20:26:56,242 INFO L226 Difference]: Without dead ends: 3980 [2025-03-16 20:26:56,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:56,247 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 39 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:56,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3066 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2025-03-16 20:26:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3978. [2025-03-16 20:26:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3976 states have (on average 1.45523138832998) internal successors, (5786), 3977 states have internal predecessors, (5786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5786 transitions. [2025-03-16 20:26:56,321 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5786 transitions. Word has length 80 [2025-03-16 20:26:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:56,321 INFO L471 AbstractCegarLoop]: Abstraction has 3978 states and 5786 transitions. [2025-03-16 20:26:56,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-16 20:26:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5786 transitions. [2025-03-16 20:26:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:26:56,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:56,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:56,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:26:56,323 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:56,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:56,323 INFO L85 PathProgramCache]: Analyzing trace with hash -260930327, now seen corresponding path program 1 times [2025-03-16 20:26:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572313779] [2025-03-16 20:26:56,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:56,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:26:56,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:26:56,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572313779] [2025-03-16 20:26:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572313779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:56,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637904379] [2025-03-16 20:26:56,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:56,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:56,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:56,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:56,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:56,402 INFO L87 Difference]: Start difference. First operand 3978 states and 5786 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:56,443 INFO L93 Difference]: Finished difference Result 4814 states and 6945 transitions. [2025-03-16 20:26:56,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:56,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-16 20:26:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:56,448 INFO L225 Difference]: With dead ends: 4814 [2025-03-16 20:26:56,448 INFO L226 Difference]: Without dead ends: 3148 [2025-03-16 20:26:56,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:56,452 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 36 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:56,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3051 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2025-03-16 20:26:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3146. [2025-03-16 20:26:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 3144 states have (on average 1.4681933842239185) internal successors, (4616), 3145 states have internal predecessors, (4616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4616 transitions. [2025-03-16 20:26:56,504 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4616 transitions. Word has length 82 [2025-03-16 20:26:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:56,504 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 4616 transitions. [2025-03-16 20:26:56,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4616 transitions. [2025-03-16 20:26:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 20:26:56,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:56,505 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:26:56,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:26:56,506 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:56,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1013848350, now seen corresponding path program 1 times [2025-03-16 20:26:56,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:56,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542818216] [2025-03-16 20:26:56,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:56,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:26:56,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:26:56,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:56,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542818216] [2025-03-16 20:26:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542818216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:26:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2837722] [2025-03-16 20:26:57,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:57,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:26:57,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:57,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:26:57,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:26:57,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:26:57,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:26:57,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:57,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:57,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 20:26:57,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:26:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:57,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:58,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2837722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:58,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:58,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:26:58,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441987325] [2025-03-16 20:26:58,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:58,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:26:58,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:58,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:26:58,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:26:58,087 INFO L87 Difference]: Start difference. First operand 3146 states and 4616 transitions. Second operand has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:01,736 INFO L93 Difference]: Finished difference Result 10004 states and 13773 transitions. [2025-03-16 20:27:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-16 20:27:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 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 84 [2025-03-16 20:27:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:01,745 INFO L225 Difference]: With dead ends: 10004 [2025-03-16 20:27:01,745 INFO L226 Difference]: Without dead ends: 9084 [2025-03-16 20:27:01,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3341 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1576, Invalid=7930, Unknown=0, NotChecked=0, Total=9506 [2025-03-16 20:27:01,750 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 14715 mSDsluCounter, 7125 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14715 SdHoareTripleChecker+Valid, 8697 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:01,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14715 Valid, 8697 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 20:27:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2025-03-16 20:27:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 8426. [2025-03-16 20:27:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8426 states, 8424 states have (on average 1.3723884140550808) internal successors, (11561), 8425 states have internal predecessors, (11561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8426 states to 8426 states and 11561 transitions. [2025-03-16 20:27:01,941 INFO L78 Accepts]: Start accepts. Automaton has 8426 states and 11561 transitions. Word has length 84 [2025-03-16 20:27:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:01,941 INFO L471 AbstractCegarLoop]: Abstraction has 8426 states and 11561 transitions. [2025-03-16 20:27:01,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 8426 states and 11561 transitions. [2025-03-16 20:27:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:27:01,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:01,942 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:27:01,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:27:02,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 20:27:02,143 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:02,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1253413577, now seen corresponding path program 1 times [2025-03-16 20:27:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:02,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691219754] [2025-03-16 20:27:02,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:02,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:02,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:27:02,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:27:02,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:02,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:02,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691219754] [2025-03-16 20:27:02,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691219754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:27:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907380850] [2025-03-16 20:27:02,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:02,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:27:02,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:27:02,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:27:02,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:27:02,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:27:02,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:27:02,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:02,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:27:02,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:27:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:02,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:27:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:03,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907380850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:27:03,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:27:03,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-16 20:27:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864799316] [2025-03-16 20:27:03,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:27:03,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 20:27:03,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:03,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 20:27:03,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-03-16 20:27:03,530 INFO L87 Difference]: Start difference. First operand 8426 states and 11561 transitions. Second operand has 25 states, 25 states have (on average 9.52) internal successors, (238), 24 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:04,863 INFO L93 Difference]: Finished difference Result 26744 states and 35804 transitions. [2025-03-16 20:27:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:27:04,863 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.52) internal successors, (238), 24 states have internal predecessors, (238), 0 states have call successors, (0), 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 85 [2025-03-16 20:27:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:04,887 INFO L225 Difference]: With dead ends: 26744 [2025-03-16 20:27:04,887 INFO L226 Difference]: Without dead ends: 20736 [2025-03-16 20:27:04,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=450, Invalid=1712, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 20:27:04,894 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 15721 mSDsluCounter, 6610 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15721 SdHoareTripleChecker+Valid, 8113 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:04,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15721 Valid, 8113 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:27:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20736 states. [2025-03-16 20:27:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20736 to 20642. [2025-03-16 20:27:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20642 states, 20640 states have (on average 1.3191375968992247) internal successors, (27227), 20641 states have internal predecessors, (27227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20642 states to 20642 states and 27227 transitions. [2025-03-16 20:27:05,395 INFO L78 Accepts]: Start accepts. Automaton has 20642 states and 27227 transitions. Word has length 85 [2025-03-16 20:27:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:05,396 INFO L471 AbstractCegarLoop]: Abstraction has 20642 states and 27227 transitions. [2025-03-16 20:27:05,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.52) internal successors, (238), 24 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 20642 states and 27227 transitions. [2025-03-16 20:27:05,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:27:05,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:05,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:05,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:27:05,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 20:27:05,597 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:05,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:05,598 INFO L85 PathProgramCache]: Analyzing trace with hash -899004537, now seen corresponding path program 1 times [2025-03-16 20:27:05,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:05,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729063276] [2025-03-16 20:27:05,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:05,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:05,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:27:05,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:27:05,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:05,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:06,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:06,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729063276] [2025-03-16 20:27:06,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729063276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:27:06,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824266011] [2025-03-16 20:27:06,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:06,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:27:06,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:27:06,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:27:06,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:27:06,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:27:06,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:27:06,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:06,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:06,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:27:06,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:27:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:06,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:27:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824266011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:27:06,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:27:06,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-16 20:27:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103776111] [2025-03-16 20:27:06,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:27:06,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:27:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:06,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:27:06,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:27:06,997 INFO L87 Difference]: Start difference. First operand 20642 states and 27227 transitions. Second operand has 28 states, 28 states have (on average 7.821428571428571) internal successors, (219), 27 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:08,468 INFO L93 Difference]: Finished difference Result 42328 states and 55567 transitions. [2025-03-16 20:27:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:27:08,468 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.821428571428571) internal successors, (219), 27 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:27:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:08,501 INFO L225 Difference]: With dead ends: 42328 [2025-03-16 20:27:08,501 INFO L226 Difference]: Without dead ends: 30373 [2025-03-16 20:27:08,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=458, Invalid=1992, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 20:27:08,510 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 19122 mSDsluCounter, 7942 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19122 SdHoareTripleChecker+Valid, 9445 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:08,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19122 Valid, 9445 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:27:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30373 states. [2025-03-16 20:27:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30373 to 30224. [2025-03-16 20:27:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30224 states, 30222 states have (on average 1.3071934352458474) internal successors, (39506), 30223 states have internal predecessors, (39506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30224 states to 30224 states and 39506 transitions. [2025-03-16 20:27:09,319 INFO L78 Accepts]: Start accepts. Automaton has 30224 states and 39506 transitions. Word has length 86 [2025-03-16 20:27:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:09,319 INFO L471 AbstractCegarLoop]: Abstraction has 30224 states and 39506 transitions. [2025-03-16 20:27:09,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.821428571428571) internal successors, (219), 27 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 30224 states and 39506 transitions. [2025-03-16 20:27:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:27:09,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:09,320 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:09,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:27:09,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:27:09,521 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:09,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:09,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1144081459, now seen corresponding path program 1 times [2025-03-16 20:27:09,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:09,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361932558] [2025-03-16 20:27:09,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:09,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:27:09,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:27:09,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:09,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361932558] [2025-03-16 20:27:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361932558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:27:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448073356] [2025-03-16 20:27:09,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:09,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:27:09,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:27:09,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:27:09,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:27:09,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:27:09,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:27:09,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:09,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 20:27:09,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:27:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:10,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:27:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448073356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:27:12,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:27:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 37 [2025-03-16 20:27:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854727369] [2025-03-16 20:27:12,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:27:12,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-16 20:27:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:12,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-16 20:27:12,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 20:27:12,484 INFO L87 Difference]: Start difference. First operand 30224 states and 39506 transitions. Second operand has 38 states, 38 states have (on average 5.842105263157895) internal successors, (222), 37 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:26,614 INFO L93 Difference]: Finished difference Result 113624 states and 146885 transitions. [2025-03-16 20:27:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2025-03-16 20:27:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.842105263157895) internal successors, (222), 37 states have internal predecessors, (222), 0 states have call successors, (0), 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 86 [2025-03-16 20:27:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:26,709 INFO L225 Difference]: With dead ends: 113624 [2025-03-16 20:27:26,709 INFO L226 Difference]: Without dead ends: 85996 [2025-03-16 20:27:26,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13323 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=6096, Invalid=29814, Unknown=0, NotChecked=0, Total=35910 [2025-03-16 20:27:26,741 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 24190 mSDsluCounter, 9973 mSDsCounter, 0 mSdLazyCounter, 3284 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24190 SdHoareTripleChecker+Valid, 11547 SdHoareTripleChecker+Invalid, 3390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:26,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24190 Valid, 11547 Invalid, 3390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3284 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 20:27:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85996 states. [2025-03-16 20:27:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85996 to 63910. [2025-03-16 20:27:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63910 states, 63908 states have (on average 1.289885460349252) internal successors, (82434), 63909 states have internal predecessors, (82434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63910 states to 63910 states and 82434 transitions. [2025-03-16 20:27:28,922 INFO L78 Accepts]: Start accepts. Automaton has 63910 states and 82434 transitions. Word has length 86 [2025-03-16 20:27:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:28,922 INFO L471 AbstractCegarLoop]: Abstraction has 63910 states and 82434 transitions. [2025-03-16 20:27:28,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.842105263157895) internal successors, (222), 37 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 63910 states and 82434 transitions. [2025-03-16 20:27:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:27:28,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:28,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:28,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:27:29,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 20:27:29,124 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:29,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:29,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1191748019, now seen corresponding path program 1 times [2025-03-16 20:27:29,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:29,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650517562] [2025-03-16 20:27:29,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:29,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:29,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:27:29,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:27:29,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:29,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:29,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650517562] [2025-03-16 20:27:29,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650517562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:27:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69211548] [2025-03-16 20:27:29,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:29,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:27:29,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:27:29,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:27:29,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:27:29,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:27:29,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:27:29,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:29,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:29,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 20:27:29,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:27:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:31,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:27:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:33,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69211548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:27:33,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:27:33,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 48 [2025-03-16 20:27:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877733727] [2025-03-16 20:27:33,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:27:33,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-16 20:27:33,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:33,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-16 20:27:33,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1943, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 20:27:33,776 INFO L87 Difference]: Start difference. First operand 63910 states and 82434 transitions. Second operand has 48 states, 48 states have (on average 4.895833333333333) internal successors, (235), 48 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:43,336 INFO L93 Difference]: Finished difference Result 154987 states and 197938 transitions. [2025-03-16 20:27:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-16 20:27:43,337 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.895833333333333) internal successors, (235), 48 states have internal predecessors, (235), 0 states have call successors, (0), 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 88 [2025-03-16 20:27:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:43,488 INFO L225 Difference]: With dead ends: 154987 [2025-03-16 20:27:43,489 INFO L226 Difference]: Without dead ends: 134275 [2025-03-16 20:27:43,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2892 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2135, Invalid=8371, Unknown=0, NotChecked=0, Total=10506 [2025-03-16 20:27:43,528 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 20193 mSDsluCounter, 19199 mSDsCounter, 0 mSdLazyCounter, 2615 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20193 SdHoareTripleChecker+Valid, 20720 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:43,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20193 Valid, 20720 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2615 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 20:27:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134275 states. [2025-03-16 20:27:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134275 to 61179. [2025-03-16 20:27:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61179 states, 61177 states have (on average 1.285499452408585) internal successors, (78643), 61178 states have internal predecessors, (78643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61179 states to 61179 states and 78643 transitions. [2025-03-16 20:27:46,356 INFO L78 Accepts]: Start accepts. Automaton has 61179 states and 78643 transitions. Word has length 88 [2025-03-16 20:27:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:46,356 INFO L471 AbstractCegarLoop]: Abstraction has 61179 states and 78643 transitions. [2025-03-16 20:27:46,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.895833333333333) internal successors, (235), 48 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 61179 states and 78643 transitions. [2025-03-16 20:27:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:27:46,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:46,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:46,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:27:46,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 20:27:46,558 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:46,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash 84908909, now seen corresponding path program 1 times [2025-03-16 20:27:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596066420] [2025-03-16 20:27:46,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:46,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:27:46,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:27:46,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:46,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:47,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:47,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596066420] [2025-03-16 20:27:47,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596066420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:27:47,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801607137] [2025-03-16 20:27:47,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:47,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:27:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:27:47,035 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:27:47,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:27:47,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:27:47,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:27:47,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:47,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:47,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-16 20:27:47,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:27:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:50,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:27:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:54,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801607137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:27:54,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:27:54,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 24] total 61 [2025-03-16 20:27:54,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191513226] [2025-03-16 20:27:54,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:27:54,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-16 20:27:54,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:54,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-16 20:27:54,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=3268, Unknown=0, NotChecked=0, Total=3660 [2025-03-16 20:27:54,608 INFO L87 Difference]: Start difference. First operand 61179 states and 78643 transitions. Second operand has 61 states, 61 states have (on average 3.7704918032786887) internal successors, (230), 61 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)