./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.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.ufo.UNBOUNDED.pals+Problem12_label05.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 77efdc70644c4d76b2b51ad31e4c72e04d88f3f8d138a44eb5f8e2813c15326a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:28:32,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:28:32,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:28:32,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:28:32,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:28:32,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:28:32,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:28:32,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:28:32,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:28:32,939 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:28:32,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:28:32,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:28:32,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:28:32,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:28:32,941 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:28:32,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:28:32,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:28:32,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:28:32,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:28:32,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:28:32,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:28:32,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:28:32,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:28:32,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:28:32,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:28:32,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:28:32,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:28:32,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:28:32,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:28:32,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:28:32,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:28:32,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:28:32,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:28:32,944 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 -> 77efdc70644c4d76b2b51ad31e4c72e04d88f3f8d138a44eb5f8e2813c15326a [2025-03-16 20:28:33,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:28:33,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:28:33,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:28:33,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:28:33,161 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:28:33,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:28:34,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12635985/4e2e27bdb3db40f8831f4ae3dd064c1a/FLAG9e9d7038d [2025-03-16 20:28:34,656 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:28:34,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:28:34,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12635985/4e2e27bdb3db40f8831f4ae3dd064c1a/FLAG9e9d7038d [2025-03-16 20:28:34,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12635985/4e2e27bdb3db40f8831f4ae3dd064c1a [2025-03-16 20:28:34,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:28:34,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:28:34,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:28:34,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:28:34,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:28:34,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:28:34" (1/1) ... [2025-03-16 20:28:34,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c4a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:34, skipping insertion in model container [2025-03-16 20:28:34,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:28:34" (1/1) ... [2025-03-16 20:28:34,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:28:35,172 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.ufo.UNBOUNDED.pals+Problem12_label05.c[11668,11681] [2025-03-16 20:28:35,213 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.ufo.UNBOUNDED.pals+Problem12_label05.c[18604,18617] [2025-03-16 20:28:35,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:28:35,606 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:28:35,628 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.ufo.UNBOUNDED.pals+Problem12_label05.c[11668,11681] [2025-03-16 20:28:35,637 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.ufo.UNBOUNDED.pals+Problem12_label05.c[18604,18617] [2025-03-16 20:28:35,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:28:35,896 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:28:35,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35 WrapperNode [2025-03-16 20:28:35,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:28:35,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:28:35,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:28:35,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:28:35,903 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:28:35" (1/1) ... [2025-03-16 20:28:35,939 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:28:35" (1/1) ... [2025-03-16 20:28:36,153 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5091 [2025-03-16 20:28:36,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:28:36,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:28:36,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:28:36,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:28:36,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,343 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:28:36,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:28:36,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:28:36,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:28:36,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:28:36,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (1/1) ... [2025-03-16 20:28:36,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:28:36,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:36,599 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:28:36,604 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:28:36,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:28:36,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:28:36,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:28:36,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:28:36,708 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:28:36,709 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:28:39,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2025-03-16 20:28:39,981 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2025-03-16 20:28:39,981 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2025-03-16 20:28:40,114 INFO L? ?]: Removed 740 outVars from TransFormulas that were not future-live. [2025-03-16 20:28:40,114 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:28:40,136 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:28:40,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:28:40,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:28:40 BoogieIcfgContainer [2025-03-16 20:28:40,138 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:28:40,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:28:40,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:28:40,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:28:40,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:28:34" (1/3) ... [2025-03-16 20:28:40,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbe3aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:28:40, skipping insertion in model container [2025-03-16 20:28:40,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:35" (2/3) ... [2025-03-16 20:28:40,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbe3aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:28:40, skipping insertion in model container [2025-03-16 20:28:40,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:28:40" (3/3) ... [2025-03-16 20:28:40,146 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:28:40,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:28:40,161 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 836 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:28:40,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:28:40,239 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;@39afaa6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:28:40,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:28:40,245 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:28:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:28:40,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:40,252 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:28:40,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:40,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash -264315576, now seen corresponding path program 1 times [2025-03-16 20:28:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:40,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424326199] [2025-03-16 20:28:40,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:40,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:40,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:28:40,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:28:40,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:40,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:40,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:40,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424326199] [2025-03-16 20:28:40,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424326199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:40,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:40,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:28:40,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632193553] [2025-03-16 20:28:40,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:40,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:28:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:40,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:28:40,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:28:40,458 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:28:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:40,526 INFO L93 Difference]: Finished difference Result 1637 states and 3218 transitions. [2025-03-16 20:28:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:28:40,528 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:28:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:40,542 INFO L225 Difference]: With dead ends: 1637 [2025-03-16 20:28:40,542 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:28:40,547 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:28:40,551 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:28:40,553 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:28:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:28:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-16 20:28:40,597 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:28:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1574 transitions. [2025-03-16 20:28:40,603 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1574 transitions. Word has length 21 [2025-03-16 20:28:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:40,603 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1574 transitions. [2025-03-16 20:28:40,603 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:28:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1574 transitions. [2025-03-16 20:28:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:28:40,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:40,604 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:28:40,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:28:40,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1088994121, now seen corresponding path program 1 times [2025-03-16 20:28:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:40,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560697363] [2025-03-16 20:28:40,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:40,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:28:40,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:28:40,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:40,822 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:28:40,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:40,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560697363] [2025-03-16 20:28:40,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560697363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:40,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:40,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:28:40,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414511826] [2025-03-16 20:28:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:40,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:28:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:40,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:28:40,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:28:40,824 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:28:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:40,913 INFO L93 Difference]: Finished difference Result 878 states and 1646 transitions. [2025-03-16 20:28:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:28:40,913 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:28:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:40,916 INFO L225 Difference]: With dead ends: 878 [2025-03-16 20:28:40,916 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:28:40,917 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:28:40,917 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:28:40,917 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:28:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:28:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-16 20:28:40,931 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:28:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1543 transitions. [2025-03-16 20:28:40,934 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1543 transitions. Word has length 21 [2025-03-16 20:28:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:40,934 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1543 transitions. [2025-03-16 20:28:40,934 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:28:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1543 transitions. [2025-03-16 20:28:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:28:40,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:40,935 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:28:40,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:28:40,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:40,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:40,936 INFO L85 PathProgramCache]: Analyzing trace with hash -586643669, now seen corresponding path program 1 times [2025-03-16 20:28:40,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:40,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957677484] [2025-03-16 20:28:40,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:40,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:28:40,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:28:40,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:40,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:41,125 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:28:41,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:41,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957677484] [2025-03-16 20:28:41,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957677484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:41,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:41,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450339168] [2025-03-16 20:28:41,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:41,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:41,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:41,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:41,127 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:28:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:41,352 INFO L93 Difference]: Finished difference Result 1262 states and 2233 transitions. [2025-03-16 20:28:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:28:41,353 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:28:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:41,361 INFO L225 Difference]: With dead ends: 1262 [2025-03-16 20:28:41,361 INFO L226 Difference]: Without dead ends: 1219 [2025-03-16 20:28:41,362 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:28:41,364 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:28:41,364 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:28:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-16 20:28:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 873. [2025-03-16 20:28:41,386 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:28:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1609 transitions. [2025-03-16 20:28:41,390 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1609 transitions. Word has length 51 [2025-03-16 20:28:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:41,391 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1609 transitions. [2025-03-16 20:28:41,391 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:28:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1609 transitions. [2025-03-16 20:28:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:28:41,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:41,395 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:28:41,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:28:41,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:41,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1086667923, now seen corresponding path program 1 times [2025-03-16 20:28:41,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775556923] [2025-03-16 20:28:41,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:41,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:28:41,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:28:41,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:41,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:41,741 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:28:41,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:41,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775556923] [2025-03-16 20:28:41,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775556923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:41,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:41,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569647678] [2025-03-16 20:28:41,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:41,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:41,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:41,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:41,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:41,742 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:28:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:41,910 INFO L93 Difference]: Finished difference Result 959 states and 1745 transitions. [2025-03-16 20:28:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:41,911 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:28:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:41,915 INFO L225 Difference]: With dead ends: 959 [2025-03-16 20:28:41,915 INFO L226 Difference]: Without dead ends: 875 [2025-03-16 20:28:41,915 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:28:41,916 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:41,917 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.1s Time] [2025-03-16 20:28:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-16 20:28:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2025-03-16 20:28:41,942 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:28:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1608 transitions. [2025-03-16 20:28:41,946 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1608 transitions. Word has length 53 [2025-03-16 20:28:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:41,946 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1608 transitions. [2025-03-16 20:28:41,946 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:28:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1608 transitions. [2025-03-16 20:28:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:28:41,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:41,949 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:28:41,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:28:41,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:41,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1087710608, now seen corresponding path program 1 times [2025-03-16 20:28:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780031724] [2025-03-16 20:28:41,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:41,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:41,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:28:41,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:28:41,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:41,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,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:28:42,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780031724] [2025-03-16 20:28:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780031724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876224092] [2025-03-16 20:28:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:42,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:42,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:42,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:42,051 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:28:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:42,084 INFO L93 Difference]: Finished difference Result 1030 states and 1857 transitions. [2025-03-16 20:28:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:42,084 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:28:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:42,087 INFO L225 Difference]: With dead ends: 1030 [2025-03-16 20:28:42,087 INFO L226 Difference]: Without dead ends: 946 [2025-03-16 20:28:42,089 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:28:42,090 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:28:42,090 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:28:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-16 20:28:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 942. [2025-03-16 20:28:42,106 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:28:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1715 transitions. [2025-03-16 20:28:42,109 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1715 transitions. Word has length 53 [2025-03-16 20:28:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:42,110 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1715 transitions. [2025-03-16 20:28:42,110 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:28:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1715 transitions. [2025-03-16 20:28:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 20:28:42,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:42,111 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:28:42,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:28:42,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:42,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash 674017815, now seen corresponding path program 1 times [2025-03-16 20:28:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287704215] [2025-03-16 20:28:42,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:42,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 20:28:42,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 20:28:42,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:42,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,303 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:28:42,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287704215] [2025-03-16 20:28:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287704215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:42,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:42,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:28:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401060070] [2025-03-16 20:28:42,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:42,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:28:42,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:42,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:28:42,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:28:42,304 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:28:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:42,350 INFO L93 Difference]: Finished difference Result 948 states and 1722 transitions. [2025-03-16 20:28:42,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:28:42,351 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:28:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:42,354 INFO L225 Difference]: With dead ends: 948 [2025-03-16 20:28:42,354 INFO L226 Difference]: Without dead ends: 946 [2025-03-16 20:28:42,355 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:28:42,355 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:28:42,355 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:28:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-16 20:28:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2025-03-16 20:28:42,372 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:28:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1718 transitions. [2025-03-16 20:28:42,375 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1718 transitions. Word has length 54 [2025-03-16 20:28:42,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:42,376 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1718 transitions. [2025-03-16 20:28:42,376 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:28:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1718 transitions. [2025-03-16 20:28:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:42,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:42,377 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:28:42,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:28:42,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:42,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash 232477583, now seen corresponding path program 1 times [2025-03-16 20:28:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:42,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017240446] [2025-03-16 20:28:42,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:42,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:42,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:42,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:42,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:42,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,444 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:28:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017240446] [2025-03-16 20:28:42,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017240446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:42,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:42,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729967969] [2025-03-16 20:28:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:42,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:42,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:42,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:42,446 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:28:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:42,465 INFO L93 Difference]: Finished difference Result 1244 states and 2178 transitions. [2025-03-16 20:28:42,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:42,466 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:28:42,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:42,470 INFO L225 Difference]: With dead ends: 1244 [2025-03-16 20:28:42,470 INFO L226 Difference]: Without dead ends: 1087 [2025-03-16 20:28:42,471 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:28:42,471 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:28:42,472 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:28:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-03-16 20:28:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1085. [2025-03-16 20:28:42,510 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:28:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1929 transitions. [2025-03-16 20:28:42,514 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1929 transitions. Word has length 55 [2025-03-16 20:28:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:42,514 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1929 transitions. [2025-03-16 20:28:42,514 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:28:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1929 transitions. [2025-03-16 20:28:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:42,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:42,515 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:28:42,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:28:42,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 989518223, now seen corresponding path program 1 times [2025-03-16 20:28:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:42,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213141449] [2025-03-16 20:28:42,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:42,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:42,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:42,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:42,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,575 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:28:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:42,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213141449] [2025-03-16 20:28:42,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213141449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:42,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:42,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:42,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397010797] [2025-03-16 20:28:42,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:42,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:42,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:42,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:42,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:42,576 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:28:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:42,600 INFO L93 Difference]: Finished difference Result 1645 states and 2783 transitions. [2025-03-16 20:28:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:42,601 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:28:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:42,605 INFO L225 Difference]: With dead ends: 1645 [2025-03-16 20:28:42,605 INFO L226 Difference]: Without dead ends: 1349 [2025-03-16 20:28:42,606 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:28:42,606 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:28:42,606 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:28:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-03-16 20:28:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1347. [2025-03-16 20:28:42,626 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:28:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2319 transitions. [2025-03-16 20:28:42,630 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2319 transitions. Word has length 55 [2025-03-16 20:28:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:42,631 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 2319 transitions. [2025-03-16 20:28:42,631 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:28:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2319 transitions. [2025-03-16 20:28:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:42,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:42,631 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:28:42,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:28:42,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:42,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash 439729295, now seen corresponding path program 1 times [2025-03-16 20:28:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:42,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628170143] [2025-03-16 20:28:42,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:42,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:42,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:42,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:42,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:42,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,669 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:28:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:42,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628170143] [2025-03-16 20:28:42,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628170143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:42,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:42,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:42,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195906272] [2025-03-16 20:28:42,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:42,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:42,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:42,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:42,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:42,670 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:28:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:42,698 INFO L93 Difference]: Finished difference Result 2399 states and 3897 transitions. [2025-03-16 20:28:42,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:42,699 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:28:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:42,704 INFO L225 Difference]: With dead ends: 2399 [2025-03-16 20:28:42,704 INFO L226 Difference]: Without dead ends: 1841 [2025-03-16 20:28:42,705 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:28:42,706 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:28:42,706 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:28:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2025-03-16 20:28:42,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1839. [2025-03-16 20:28:42,735 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:28:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 3035 transitions. [2025-03-16 20:28:42,740 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 3035 transitions. Word has length 55 [2025-03-16 20:28:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:42,741 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 3035 transitions. [2025-03-16 20:28:42,741 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:28:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 3035 transitions. [2025-03-16 20:28:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:42,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:42,741 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:28:42,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:28:42,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1055700623, now seen corresponding path program 1 times [2025-03-16 20:28:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:42,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357457221] [2025-03-16 20:28:42,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:42,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:42,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:42,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:42,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:42,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,780 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:28:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:42,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357457221] [2025-03-16 20:28:42,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357457221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:42,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:42,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:42,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442137335] [2025-03-16 20:28:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:42,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:42,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:42,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:42,781 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:28:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:42,816 INFO L93 Difference]: Finished difference Result 3811 states and 5933 transitions. [2025-03-16 20:28:42,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:42,817 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:28:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:42,824 INFO L225 Difference]: With dead ends: 3811 [2025-03-16 20:28:42,824 INFO L226 Difference]: Without dead ends: 2761 [2025-03-16 20:28:42,826 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:28:42,826 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:28:42,826 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:28:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2025-03-16 20:28:42,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2759. [2025-03-16 20:28:42,867 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:28:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 4339 transitions. [2025-03-16 20:28:42,875 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 4339 transitions. Word has length 55 [2025-03-16 20:28:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:42,875 INFO L471 AbstractCegarLoop]: Abstraction has 2759 states and 4339 transitions. [2025-03-16 20:28:42,875 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:28:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 4339 transitions. [2025-03-16 20:28:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:28:42,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:42,876 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:28:42,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:28:42,876 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:42,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash -441912209, now seen corresponding path program 1 times [2025-03-16 20:28:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:42,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121727013] [2025-03-16 20:28:42,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:42,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:42,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:28:42,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:28:42,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:42,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121727013] [2025-03-16 20:28:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121727013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:42,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581668696] [2025-03-16 20:28:42,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:42,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:42,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:42,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:42,916 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:28:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:42,962 INFO L93 Difference]: Finished difference Result 4814 states and 7385 transitions. [2025-03-16 20:28:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:42,962 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:28:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:42,974 INFO L225 Difference]: With dead ends: 4814 [2025-03-16 20:28:42,974 INFO L226 Difference]: Without dead ends: 3691 [2025-03-16 20:28:42,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:28:42,977 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:28:42,977 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:28:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2025-03-16 20:28:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3689. [2025-03-16 20:28:43,039 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:28:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 5669 transitions. [2025-03-16 20:28:43,049 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 5669 transitions. Word has length 57 [2025-03-16 20:28:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:43,049 INFO L471 AbstractCegarLoop]: Abstraction has 3689 states and 5669 transitions. [2025-03-16 20:28:43,050 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:28:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 5669 transitions. [2025-03-16 20:28:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:28:43,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:43,050 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] [2025-03-16 20:28:43,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:28:43,050 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:43,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash 53596459, now seen corresponding path program 1 times [2025-03-16 20:28:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:43,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912414151] [2025-03-16 20:28:43,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:43,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:43,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:28:43,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:28:43,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:43,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:43,136 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:28:43,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:43,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912414151] [2025-03-16 20:28:43,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912414151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:43,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:43,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:43,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830310387] [2025-03-16 20:28:43,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:43,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:28:43,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:43,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:28:43,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:28:43,137 INFO L87 Difference]: Start difference. First operand 3689 states and 5669 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:28:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:47,720 INFO L93 Difference]: Finished difference Result 5944 states and 9978 transitions. [2025-03-16 20:28:47,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:28:47,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-16 20:28:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:47,734 INFO L225 Difference]: With dead ends: 5944 [2025-03-16 20:28:47,735 INFO L226 Difference]: Without dead ends: 5191 [2025-03-16 20:28:47,736 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:28:47,736 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 2390 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2390 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:47,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2390 Valid, 815 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 20:28:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2025-03-16 20:28:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 5191. [2025-03-16 20:28:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 5189 states have (on average 1.5022162266332626) internal successors, (7795), 5190 states have internal predecessors, (7795), 0 states have call successors, (0), 0 states 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:28:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7795 transitions. [2025-03-16 20:28:47,822 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7795 transitions. Word has length 59 [2025-03-16 20:28:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:47,822 INFO L471 AbstractCegarLoop]: Abstraction has 5191 states and 7795 transitions. [2025-03-16 20:28:47,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:28:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7795 transitions. [2025-03-16 20:28:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:47,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:47,828 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:28:47,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:28:47,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:47,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash 289567166, now seen corresponding path program 1 times [2025-03-16 20:28:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:47,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042240609] [2025-03-16 20:28:47,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:47,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:47,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:47,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:47,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:47,959 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:28:47,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042240609] [2025-03-16 20:28:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042240609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:47,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:47,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76730991] [2025-03-16 20:28:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:47,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:47,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:47,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:47,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:47,961 INFO L87 Difference]: Start difference. First operand 5191 states and 7795 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:28:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:48,243 INFO L93 Difference]: Finished difference Result 20291 states and 29609 transitions. [2025-03-16 20:28:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:48,244 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:28:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:48,286 INFO L225 Difference]: With dead ends: 20291 [2025-03-16 20:28:48,286 INFO L226 Difference]: Without dead ends: 17393 [2025-03-16 20:28:48,293 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:28:48,293 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:28:48,294 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:28:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17393 states. [2025-03-16 20:28:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17393 to 8087. [2025-03-16 20:28:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8087 states, 8085 states have (on average 1.4766852195423623) internal successors, (11939), 8086 states have internal predecessors, (11939), 0 states have call successors, (0), 0 states 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:28:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8087 states to 8087 states and 11939 transitions. [2025-03-16 20:28:48,547 INFO L78 Accepts]: Start accepts. Automaton has 8087 states and 11939 transitions. Word has length 73 [2025-03-16 20:28:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:48,548 INFO L471 AbstractCegarLoop]: Abstraction has 8087 states and 11939 transitions. [2025-03-16 20:28:48,552 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:28:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8087 states and 11939 transitions. [2025-03-16 20:28:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:48,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:48,554 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:28:48,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:28:48,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:48,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1046607806, now seen corresponding path program 1 times [2025-03-16 20:28:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:48,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819983026] [2025-03-16 20:28:48,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:48,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:48,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:48,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:48,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:48,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:48,675 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:28:48,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819983026] [2025-03-16 20:28:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819983026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:48,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920998872] [2025-03-16 20:28:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:48,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:48,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:48,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:48,677 INFO L87 Difference]: Start difference. First operand 8087 states and 11939 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:28:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:49,118 INFO L93 Difference]: Finished difference Result 23187 states and 33753 transitions. [2025-03-16 20:28:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:49,119 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:28:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:49,152 INFO L225 Difference]: With dead ends: 23187 [2025-03-16 20:28:49,153 INFO L226 Difference]: Without dead ends: 20289 [2025-03-16 20:28:49,161 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:28:49,162 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:28:49,162 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:28:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20289 states. [2025-03-16 20:28:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20289 to 12439. [2025-03-16 20:28:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12439 states, 12437 states have (on average 1.4565409664710138) internal successors, (18115), 12438 states have internal predecessors, (18115), 0 states have call successors, (0), 0 states 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:28:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 18115 transitions. [2025-03-16 20:28:49,436 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 18115 transitions. Word has length 73 [2025-03-16 20:28:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:49,436 INFO L471 AbstractCegarLoop]: Abstraction has 12439 states and 18115 transitions. [2025-03-16 20:28:49,437 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:28:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 18115 transitions. [2025-03-16 20:28:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:49,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:49,438 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:28:49,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:28:49,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:49,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash 496818878, now seen corresponding path program 1 times [2025-03-16 20:28:49,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:49,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121105841] [2025-03-16 20:28:49,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:49,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:49,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:49,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:49,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:49,558 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:28:49,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:49,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121105841] [2025-03-16 20:28:49,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121105841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:49,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:49,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:49,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578803276] [2025-03-16 20:28:49,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:49,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:49,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:49,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:49,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:49,560 INFO L87 Difference]: Start difference. First operand 12439 states and 18115 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:28:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:49,890 INFO L93 Difference]: Finished difference Result 26083 states and 37897 transitions. [2025-03-16 20:28:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:49,891 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:28:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:49,927 INFO L225 Difference]: With dead ends: 26083 [2025-03-16 20:28:49,927 INFO L226 Difference]: Without dead ends: 23185 [2025-03-16 20:28:49,935 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:28:49,936 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:28:49,936 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:28:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23185 states. [2025-03-16 20:28:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23185 to 15335. [2025-03-16 20:28:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15335 states, 15333 states have (on average 1.451705471858084) internal successors, (22259), 15334 states have internal predecessors, (22259), 0 states have call successors, (0), 0 states 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:28:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15335 states to 15335 states and 22259 transitions. [2025-03-16 20:28:50,312 INFO L78 Accepts]: Start accepts. Automaton has 15335 states and 22259 transitions. Word has length 73 [2025-03-16 20:28:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 15335 states and 22259 transitions. [2025-03-16 20:28:50,313 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:28:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 15335 states and 22259 transitions. [2025-03-16 20:28:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:50,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:50,320 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:28:50,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:28:50,320 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:50,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1112790206, now seen corresponding path program 1 times [2025-03-16 20:28:50,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:50,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793048586] [2025-03-16 20:28:50,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:50,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:50,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:50,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:50,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:50,463 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:28:50,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:50,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793048586] [2025-03-16 20:28:50,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793048586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:50,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:50,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:50,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547920767] [2025-03-16 20:28:50,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:50,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:50,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:50,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:50,466 INFO L87 Difference]: Start difference. First operand 15335 states and 22259 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:28:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:50,907 INFO L93 Difference]: Finished difference Result 28979 states and 42041 transitions. [2025-03-16 20:28:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:50,908 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:28:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:50,941 INFO L225 Difference]: With dead ends: 28979 [2025-03-16 20:28:50,941 INFO L226 Difference]: Without dead ends: 26081 [2025-03-16 20:28:50,948 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:28:50,949 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:28:50,949 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:28:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26081 states. [2025-03-16 20:28:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26081 to 18231. [2025-03-16 20:28:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18231 states, 18229 states have (on average 1.4484063854298097) internal successors, (26403), 18230 states have internal predecessors, (26403), 0 states have call successors, (0), 0 states 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:28:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18231 states to 18231 states and 26403 transitions. [2025-03-16 20:28:51,442 INFO L78 Accepts]: Start accepts. Automaton has 18231 states and 26403 transitions. Word has length 73 [2025-03-16 20:28:51,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:51,442 INFO L471 AbstractCegarLoop]: Abstraction has 18231 states and 26403 transitions. [2025-03-16 20:28:51,442 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:28:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 18231 states and 26403 transitions. [2025-03-16 20:28:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:28:51,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:51,445 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:28:51,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:28:51,445 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:51,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash -861645504, now seen corresponding path program 1 times [2025-03-16 20:28:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:51,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162043840] [2025-03-16 20:28:51,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:51,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:28:51,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:28:51,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:51,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:51,539 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:28:51,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:51,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162043840] [2025-03-16 20:28:51,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162043840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:51,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:51,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:51,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854063435] [2025-03-16 20:28:51,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:51,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:51,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:51,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:51,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:51,541 INFO L87 Difference]: Start difference. First operand 18231 states and 26403 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:28:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:51,782 INFO L93 Difference]: Finished difference Result 29518 states and 42793 transitions. [2025-03-16 20:28:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:51,786 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:28:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:51,803 INFO L225 Difference]: With dead ends: 29518 [2025-03-16 20:28:51,803 INFO L226 Difference]: Without dead ends: 13580 [2025-03-16 20:28:51,810 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:28:51,811 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:28:51,811 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:28:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13580 states. [2025-03-16 20:28:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13580 to 13578. [2025-03-16 20:28:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13578 states, 13576 states have (on average 1.4594873305833824) internal successors, (19814), 13577 states have internal predecessors, (19814), 0 states have call successors, (0), 0 states 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:28:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13578 states to 13578 states and 19814 transitions. [2025-03-16 20:28:52,012 INFO L78 Accepts]: Start accepts. Automaton has 13578 states and 19814 transitions. Word has length 75 [2025-03-16 20:28:52,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:52,013 INFO L471 AbstractCegarLoop]: Abstraction has 13578 states and 19814 transitions. [2025-03-16 20:28:52,013 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:28:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 13578 states and 19814 transitions. [2025-03-16 20:28:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:28:52,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:52,014 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:28:52,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:28:52,014 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1413397794, now seen corresponding path program 1 times [2025-03-16 20:28:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046500554] [2025-03-16 20:28:52,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:52,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:52,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:28:52,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:28:52,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:52,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:52,121 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:28:52,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:52,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046500554] [2025-03-16 20:28:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046500554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:52,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:52,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992696178] [2025-03-16 20:28:52,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:52,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:52,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:52,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:52,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:52,123 INFO L87 Difference]: Start difference. First operand 13578 states and 19814 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:28:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:52,494 INFO L93 Difference]: Finished difference Result 23830 states and 34700 transitions. [2025-03-16 20:28:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:52,494 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:28:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:52,524 INFO L225 Difference]: With dead ends: 23830 [2025-03-16 20:28:52,525 INFO L226 Difference]: Without dead ends: 21780 [2025-03-16 20:28:52,529 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:28:52,530 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:28:52,530 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:28:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21780 states. [2025-03-16 20:28:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21780 to 15626. [2025-03-16 20:28:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15626 states, 15624 states have (on average 1.456605222734255) internal successors, (22758), 15625 states have internal predecessors, (22758), 0 states have call successors, (0), 0 states 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:28:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15626 states to 15626 states and 22758 transitions. [2025-03-16 20:28:52,815 INFO L78 Accepts]: Start accepts. Automaton has 15626 states and 22758 transitions. Word has length 75 [2025-03-16 20:28:52,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:52,815 INFO L471 AbstractCegarLoop]: Abstraction has 15626 states and 22758 transitions. [2025-03-16 20:28:52,815 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:28:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 15626 states and 22758 transitions. [2025-03-16 20:28:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:28:52,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:52,817 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:28:52,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:28:52,817 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:52,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash 936423678, now seen corresponding path program 1 times [2025-03-16 20:28:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:52,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445716460] [2025-03-16 20:28:52,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:52,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:52,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:28:52,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:28:52,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:52,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:52,887 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:28:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:52,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445716460] [2025-03-16 20:28:52,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445716460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:52,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669869252] [2025-03-16 20:28:52,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:52,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:52,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:52,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:52,888 INFO L87 Difference]: Start difference. First operand 15626 states and 22758 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:28:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:52,999 INFO L93 Difference]: Finished difference Result 22286 states and 32328 transitions. [2025-03-16 20:28:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:53,000 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:28:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:53,010 INFO L225 Difference]: With dead ends: 22286 [2025-03-16 20:28:53,010 INFO L226 Difference]: Without dead ends: 8972 [2025-03-16 20:28:53,021 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:28:53,021 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:28:53,021 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:28:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8972 states. [2025-03-16 20:28:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8972 to 8970. [2025-03-16 20:28:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8970 states, 8968 states have (on average 1.4591882247992864) internal successors, (13086), 8969 states have internal predecessors, (13086), 0 states have call successors, (0), 0 states 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:28:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8970 states to 8970 states and 13086 transitions. [2025-03-16 20:28:53,244 INFO L78 Accepts]: Start accepts. Automaton has 8970 states and 13086 transitions. Word has length 76 [2025-03-16 20:28:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:53,244 INFO L471 AbstractCegarLoop]: Abstraction has 8970 states and 13086 transitions. [2025-03-16 20:28:53,244 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:28:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 8970 states and 13086 transitions. [2025-03-16 20:28:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:28:53,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:53,246 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:28:53,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:28:53,246 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:53,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1884587529, now seen corresponding path program 1 times [2025-03-16 20:28:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:53,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714911363] [2025-03-16 20:28:53,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:53,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:53,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:28:53,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:28:53,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:53,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:53,311 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:28:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714911363] [2025-03-16 20:28:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714911363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:53,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:53,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550920944] [2025-03-16 20:28:53,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:53,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:53,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:53,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:53,313 INFO L87 Difference]: Start difference. First operand 8970 states and 13086 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:28:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:53,373 INFO L93 Difference]: Finished difference Result 12302 states and 17820 transitions. [2025-03-16 20:28:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:53,374 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:28:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:53,381 INFO L225 Difference]: With dead ends: 12302 [2025-03-16 20:28:53,381 INFO L226 Difference]: Without dead ends: 5644 [2025-03-16 20:28:53,387 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:28:53,388 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:28:53,390 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:28:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2025-03-16 20:28:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 5642. [2025-03-16 20:28:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5642 states, 5640 states have (on average 1.471985815602837) internal successors, (8302), 5641 states have internal predecessors, (8302), 0 states have call successors, (0), 0 states 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:28:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 8302 transitions. [2025-03-16 20:28:53,470 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 8302 transitions. Word has length 78 [2025-03-16 20:28:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:53,471 INFO L471 AbstractCegarLoop]: Abstraction has 5642 states and 8302 transitions. [2025-03-16 20:28:53,471 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:28:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 8302 transitions. [2025-03-16 20:28:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 20:28:53,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:53,472 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:28:53,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:28:53,472 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:53,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:53,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1516299760, now seen corresponding path program 1 times [2025-03-16 20:28:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970298790] [2025-03-16 20:28:53,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:53,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 20:28:53,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 20:28:53,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:53,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:53,532 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:28:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:53,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970298790] [2025-03-16 20:28:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970298790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:53,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:53,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704145859] [2025-03-16 20:28:53,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:53,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:53,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:53,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:53,535 INFO L87 Difference]: Start difference. First operand 5642 states and 8302 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:28:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:53,572 INFO L93 Difference]: Finished difference Result 7310 states and 10644 transitions. [2025-03-16 20:28:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:53,572 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:28:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:53,576 INFO L225 Difference]: With dead ends: 7310 [2025-03-16 20:28:53,576 INFO L226 Difference]: Without dead ends: 3980 [2025-03-16 20:28:53,579 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:28:53,581 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:28:53,581 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:28:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2025-03-16 20:28:53,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3978. [2025-03-16 20:28:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3976 states have (on average 1.4929577464788732) internal successors, (5936), 3977 states have internal predecessors, (5936), 0 states have call successors, (0), 0 states 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:28:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5936 transitions. [2025-03-16 20:28:53,632 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5936 transitions. Word has length 80 [2025-03-16 20:28:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:53,632 INFO L471 AbstractCegarLoop]: Abstraction has 3978 states and 5936 transitions. [2025-03-16 20:28:53,632 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:28:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5936 transitions. [2025-03-16 20:28:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:28:53,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:53,633 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:28:53,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:28:53,633 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:53,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash -260930327, now seen corresponding path program 1 times [2025-03-16 20:28:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402743740] [2025-03-16 20:28:53,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:53,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:53,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:28:53,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:28:53,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:53,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:53,690 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:28:53,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402743740] [2025-03-16 20:28:53,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402743740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:53,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:53,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:53,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110397751] [2025-03-16 20:28:53,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:53,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:53,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:53,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:53,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:53,693 INFO L87 Difference]: Start difference. First operand 3978 states and 5936 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:28:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:53,719 INFO L93 Difference]: Finished difference Result 4814 states and 7095 transitions. [2025-03-16 20:28:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:53,721 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:28:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:53,724 INFO L225 Difference]: With dead ends: 4814 [2025-03-16 20:28:53,725 INFO L226 Difference]: Without dead ends: 3148 [2025-03-16 20:28:53,727 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:28:53,728 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:28:53,728 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:28:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2025-03-16 20:28:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3146. [2025-03-16 20:28:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 3144 states have (on average 1.5159033078880406) internal successors, (4766), 3145 states have internal predecessors, (4766), 0 states have call successors, (0), 0 states 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:28:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4766 transitions. [2025-03-16 20:28:53,762 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4766 transitions. Word has length 82 [2025-03-16 20:28:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:53,762 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 4766 transitions. [2025-03-16 20:28:53,762 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:28:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4766 transitions. [2025-03-16 20:28:53,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 20:28:53,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:53,763 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:28:53,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:28:53,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:53,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1013848350, now seen corresponding path program 1 times [2025-03-16 20:28:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:53,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748077904] [2025-03-16 20:28:53,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:53,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:53,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:28:53,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:28:53,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:53,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:54,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:54,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748077904] [2025-03-16 20:28:54,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748077904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:54,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459603713] [2025-03-16 20:28:54,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:54,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:54,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:54,406 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:28:54,408 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:28:54,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:28:54,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:28:54,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:54,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:28:54,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:54,813 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:28:54,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:55,103 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:28:55,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459603713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:55,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:55,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:28:55,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339256787] [2025-03-16 20:28:55,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:55,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:28:55,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:55,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:28:55,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:28:55,105 INFO L87 Difference]: Start difference. First operand 3146 states and 4766 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:28:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:58,245 INFO L93 Difference]: Finished difference Result 11016 states and 15399 transitions. [2025-03-16 20:28:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:28:58,246 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:28:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:58,255 INFO L225 Difference]: With dead ends: 11016 [2025-03-16 20:28:58,255 INFO L226 Difference]: Without dead ends: 10096 [2025-03-16 20:28:58,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1278, Invalid=6912, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 20:28:58,261 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 13648 mSDsluCounter, 8217 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13648 SdHoareTripleChecker+Valid, 9745 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:58,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13648 Valid, 9745 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 20:28:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10096 states. [2025-03-16 20:28:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10096 to 9538. [2025-03-16 20:28:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9538 states, 9536 states have (on average 1.3877936241610738) internal successors, (13234), 9537 states have internal predecessors, (13234), 0 states have call successors, (0), 0 states 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:28:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9538 states to 9538 states and 13234 transitions. [2025-03-16 20:28:58,479 INFO L78 Accepts]: Start accepts. Automaton has 9538 states and 13234 transitions. Word has length 84 [2025-03-16 20:28:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:58,479 INFO L471 AbstractCegarLoop]: Abstraction has 9538 states and 13234 transitions. [2025-03-16 20:28:58,479 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:28:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 9538 states and 13234 transitions. [2025-03-16 20:28:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:28:58,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:58,480 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:28:58,486 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:28:58,682 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:28:58,682 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:58,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:58,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1253413577, now seen corresponding path program 1 times [2025-03-16 20:28:58,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:58,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406506109] [2025-03-16 20:28:58,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:58,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:58,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:58,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:58,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:58,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:59,013 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:28:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406506109] [2025-03-16 20:28:59,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406506109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815383857] [2025-03-16 20:28:59,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:59,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:59,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:59,016 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:28:59,017 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:28:59,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:59,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:59,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:59,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:59,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:28:59,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:59,455 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:28:59,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:29:00,066 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:29:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815383857] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:29:00,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:29:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:29:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730228160] [2025-03-16 20:29:00,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:29:00,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:29:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:00,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:29:00,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:29:00,067 INFO L87 Difference]: Start difference. First operand 9538 states and 13234 transitions. Second operand has 21 states, 21 states have (on average 9.476190476190476) internal successors, (199), 20 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:29:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:00,481 INFO L93 Difference]: Finished difference Result 16848 states and 22984 transitions. [2025-03-16 20:29:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:29:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.476190476190476) internal successors, (199), 20 states have internal predecessors, (199), 0 states have call successors, (0), 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:29:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:00,490 INFO L225 Difference]: With dead ends: 16848 [2025-03-16 20:29:00,490 INFO L226 Difference]: Without dead ends: 9806 [2025-03-16 20:29:00,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:29:00,496 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 16947 mSDsluCounter, 3248 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16947 SdHoareTripleChecker+Valid, 4758 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:00,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16947 Valid, 4758 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:29:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9806 states. [2025-03-16 20:29:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9806 to 8558. [2025-03-16 20:29:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8556 states have (on average 1.3803179055633474) internal successors, (11810), 8557 states have internal predecessors, (11810), 0 states have call successors, (0), 0 states 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:29:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 11810 transitions. [2025-03-16 20:29:00,646 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 11810 transitions. Word has length 85 [2025-03-16 20:29:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:00,646 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 11810 transitions. [2025-03-16 20:29:00,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.476190476190476) internal successors, (199), 20 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:29:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 11810 transitions. [2025-03-16 20:29:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:29:00,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:00,647 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:29:00,653 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:29:00,847 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:29:00,847 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:00,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash -398242185, now seen corresponding path program 1 times [2025-03-16 20:29:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329563431] [2025-03-16 20:29:00,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:00,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:29:00,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:29:00,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:00,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:01,107 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:29:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:01,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329563431] [2025-03-16 20:29:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329563431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:29:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132807159] [2025-03-16 20:29:01,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:01,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:01,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:01,110 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:29:01,112 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:29:01,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:29:01,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:29:01,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:01,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:01,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:29:01,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:29:01,547 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:29:01,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:29:01,990 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:29:01,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132807159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:29:01,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:29:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-16 20:29:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147737391] [2025-03-16 20:29:01,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:29:01,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 20:29:01,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:01,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 20:29:01,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:29:01,991 INFO L87 Difference]: Start difference. First operand 8558 states and 11810 transitions. Second operand has 23 states, 23 states have (on average 8.173913043478262) internal successors, (188), 22 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:29:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:02,569 INFO L93 Difference]: Finished difference Result 21442 states and 28780 transitions. [2025-03-16 20:29:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:29:02,569 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.173913043478262) internal successors, (188), 22 states have internal predecessors, (188), 0 states have call successors, (0), 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:29:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:02,581 INFO L225 Difference]: With dead ends: 21442 [2025-03-16 20:29:02,582 INFO L226 Difference]: Without dead ends: 15244 [2025-03-16 20:29:02,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 20:29:02,588 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 9640 mSDsluCounter, 4784 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9640 SdHoareTripleChecker+Valid, 6294 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:02,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9640 Valid, 6294 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:29:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15244 states. [2025-03-16 20:29:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15244 to 15080. [2025-03-16 20:29:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15080 states, 15078 states have (on average 1.3379095370738825) internal successors, (20173), 15079 states have internal predecessors, (20173), 0 states have call successors, (0), 0 states 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:29:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15080 states to 15080 states and 20173 transitions. [2025-03-16 20:29:02,888 INFO L78 Accepts]: Start accepts. Automaton has 15080 states and 20173 transitions. Word has length 85 [2025-03-16 20:29:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 15080 states and 20173 transitions. [2025-03-16 20:29:02,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.173913043478262) internal successors, (188), 22 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:29:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 15080 states and 20173 transitions. [2025-03-16 20:29:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:29:02,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:02,889 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:29:02,895 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:29:03,089 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:29:03,090 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:03,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1428286409, now seen corresponding path program 1 times [2025-03-16 20:29:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421290663] [2025-03-16 20:29:03,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:03,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:29:03,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:29:03,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:03,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:03,311 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:29:03,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421290663] [2025-03-16 20:29:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421290663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:29:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542761650] [2025-03-16 20:29:03,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:03,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:03,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:03,314 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:29:03,315 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:29:03,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:29:03,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:29:03,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:03,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:03,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:29:03,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:29:04,162 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:29:04,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:29:05,055 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:29:05,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542761650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:29:05,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:29:05,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 33 [2025-03-16 20:29:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915735778] [2025-03-16 20:29:05,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:29:05,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 20:29:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:05,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 20:29:05,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 20:29:05,056 INFO L87 Difference]: Start difference. First operand 15080 states and 20173 transitions. Second operand has 33 states, 33 states have (on average 6.757575757575758) internal successors, (223), 33 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:10,335 INFO L93 Difference]: Finished difference Result 91200 states and 119202 transitions. [2025-03-16 20:29:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-16 20:29:10,336 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.757575757575758) internal successors, (223), 33 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 20:29:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:10,404 INFO L225 Difference]: With dead ends: 91200 [2025-03-16 20:29:10,404 INFO L226 Difference]: Without dead ends: 78492 [2025-03-16 20:29:10,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2503 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1823, Invalid=7107, Unknown=0, NotChecked=0, Total=8930 [2025-03-16 20:29:10,417 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 25626 mSDsluCounter, 10156 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25626 SdHoareTripleChecker+Valid, 11701 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:10,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25626 Valid, 11701 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:29:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78492 states. [2025-03-16 20:29:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78492 to 77752. [2025-03-16 20:29:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77752 states, 77750 states have (on average 1.2883344051446945) internal successors, (100168), 77751 states have internal predecessors, (100168), 0 states have call successors, (0), 0 states 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:29:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77752 states to 77752 states and 100168 transitions. [2025-03-16 20:29:12,653 INFO L78 Accepts]: Start accepts. Automaton has 77752 states and 100168 transitions. Word has length 85 [2025-03-16 20:29:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:12,653 INFO L471 AbstractCegarLoop]: Abstraction has 77752 states and 100168 transitions. [2025-03-16 20:29:12,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.757575757575758) internal successors, (223), 33 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 77752 states and 100168 transitions. [2025-03-16 20:29:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:29:12,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:12,655 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] [2025-03-16 20:29:12,662 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:29:12,856 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:29:12,856 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:12,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash -269138191, now seen corresponding path program 1 times [2025-03-16 20:29:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:12,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961494079] [2025-03-16 20:29:12,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:12,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:12,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:29:12,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:29:12,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:12,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:13,121 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:29:13,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961494079] [2025-03-16 20:29:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961494079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:29:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523390114] [2025-03-16 20:29:13,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:13,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:13,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:13,124 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:29:13,126 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:29:13,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:29:13,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:29:13,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:13,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:13,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-16 20:29:13,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:29:16,068 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:29:16,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:29:18,800 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:29:18,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523390114] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:29:18,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:29:18,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 21] total 46 [2025-03-16 20:29:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964100052] [2025-03-16 20:29:18,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:29:18,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-16 20:29:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:18,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-16 20:29:18,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1803, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 20:29:18,802 INFO L87 Difference]: Start difference. First operand 77752 states and 100168 transitions. Second operand has 47 states, 47 states have (on average 4.9361702127659575) internal successors, (232), 46 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:29:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:33,538 INFO L93 Difference]: Finished difference Result 320872 states and 413594 transitions. [2025-03-16 20:29:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-16 20:29:33,539 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.9361702127659575) internal successors, (232), 46 states have internal predecessors, (232), 0 states have call successors, (0), 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 87 [2025-03-16 20:29:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:33,842 INFO L225 Difference]: With dead ends: 320872 [2025-03-16 20:29:33,842 INFO L226 Difference]: Without dead ends: 248314 [2025-03-16 20:29:33,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6625 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=4071, Invalid=16235, Unknown=0, NotChecked=0, Total=20306 [2025-03-16 20:29:33,890 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 23292 mSDsluCounter, 14797 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23292 SdHoareTripleChecker+Valid, 16343 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:33,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23292 Valid, 16343 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 20:29:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248314 states. [2025-03-16 20:29:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248314 to 153922. [2025-03-16 20:29:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153922 states, 153920 states have (on average 1.2703677234927235) internal successors, (195535), 153921 states have internal predecessors, (195535), 0 states have call successors, (0), 0 states 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:29:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153922 states to 153922 states and 195535 transitions. [2025-03-16 20:29:40,381 INFO L78 Accepts]: Start accepts. Automaton has 153922 states and 195535 transitions. Word has length 87 [2025-03-16 20:29:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:40,381 INFO L471 AbstractCegarLoop]: Abstraction has 153922 states and 195535 transitions. [2025-03-16 20:29:40,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.9361702127659575) internal successors, (232), 46 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:29:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 153922 states and 195535 transitions. [2025-03-16 20:29:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:29:40,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:40,383 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:29:40,389 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:29:40,583 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:29:40,584 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:40,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1191748019, now seen corresponding path program 1 times [2025-03-16 20:29:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:40,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300772328] [2025-03-16 20:29:40,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:40,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:29:40,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:29:40,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:40,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:41,442 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:29:41,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:41,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300772328] [2025-03-16 20:29:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300772328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:29:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626621144] [2025-03-16 20:29:41,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:41,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:41,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:41,445 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:29:41,446 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:29:41,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:29:41,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:29:41,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:41,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:41,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 20:29:41,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:29:42,976 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:29:42,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:29:44,402 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:29:44,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626621144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:29:44,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:29:44,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 15] total 39 [2025-03-16 20:29:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786535125] [2025-03-16 20:29:44,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:29:44,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 20:29:44,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:44,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 20:29:44,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1339, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 20:29:44,404 INFO L87 Difference]: Start difference. First operand 153922 states and 195535 transitions. Second operand has 39 states, 39 states have (on average 6.17948717948718) internal successors, (241), 39 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)