./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.4.1.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 38d85b6b5a04cb96dc69842531ed31487f7945c34d1c701c72adfae91c235e8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:16:04,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:16:04,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:16:04,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:16:04,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:16:04,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:16:04,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:16:04,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:16:04,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:16:04,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:16:04,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:16:04,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:16:04,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:16:04,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:16:04,138 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:16:04,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:16:04,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:16:04,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:16:04,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:16:04,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:16:04,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:16:04,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:16:04,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:16:04,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:16:04,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:16:04,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:16:04,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:16:04,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:16:04,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:16:04,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:16:04,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:16:04,140 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 -> 38d85b6b5a04cb96dc69842531ed31487f7945c34d1c701c72adfae91c235e8c [2025-03-08 07:16:04,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:16:04,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:16:04,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:16:04,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:16:04,361 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:16:04,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:16:05,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b98e10c14/6efb5041aed1478aa5417dc7bde39af8/FLAGf709b1400 [2025-03-08 07:16:05,978 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:16:05,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:16:06,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b98e10c14/6efb5041aed1478aa5417dc7bde39af8/FLAGf709b1400 [2025-03-08 07:16:06,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b98e10c14/6efb5041aed1478aa5417dc7bde39af8 [2025-03-08 07:16:06,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:16:06,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:16:06,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:16:06,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:16:06,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:16:06,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:16:06" (1/1) ... [2025-03-08 07:16:06,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bdbc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:06, skipping insertion in model container [2025-03-08 07:16:06,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:16:06" (1/1) ... [2025-03-08 07:16:06,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:16:06,413 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.4.1.ufo.UNBOUNDED.pals+Problem12_label05.c[8749,8762] [2025-03-08 07:16:06,468 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.4.1.ufo.UNBOUNDED.pals+Problem12_label05.c[15685,15698] [2025-03-08 07:16:06,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:16:06,880 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:16:06,909 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.4.1.ufo.UNBOUNDED.pals+Problem12_label05.c[8749,8762] [2025-03-08 07:16:06,924 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.4.1.ufo.UNBOUNDED.pals+Problem12_label05.c[15685,15698] [2025-03-08 07:16:07,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:16:07,174 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:16:07,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07 WrapperNode [2025-03-08 07:16:07,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:16:07,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:16:07,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:16:07,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:16:07,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,453 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5034 [2025-03-08 07:16:07,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:16:07,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:16:07,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:16:07,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:16:07,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,669 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-08 07:16:07,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:16:07,885 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:16:07,886 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:16:07,886 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:16:07,887 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (1/1) ... [2025-03-08 07:16:07,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:16:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:16:07,911 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-08 07:16:07,915 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-08 07:16:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:16:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:16:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:16:07,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:16:08,014 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:16:08,016 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:16:11,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3537: havoc calculate_output2_#t~ret34#1; [2025-03-08 07:16:11,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5027: havoc calculate_output3_#t~ret35#1; [2025-03-08 07:16:11,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2058: havoc calculate_output_#t~ret33#1; [2025-03-08 07:16:11,544 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-03-08 07:16:11,545 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:16:11,573 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:16:11,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:16:11,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:16:11 BoogieIcfgContainer [2025-03-08 07:16:11,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:16:11,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:16:11,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:16:11,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:16:11,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:16:06" (1/3) ... [2025-03-08 07:16:11,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578769fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:16:11, skipping insertion in model container [2025-03-08 07:16:11,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:07" (2/3) ... [2025-03-08 07:16:11,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578769fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:16:11, skipping insertion in model container [2025-03-08 07:16:11,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:16:11" (3/3) ... [2025-03-08 07:16:11,582 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:16:11,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:16:11,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 886 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:16:11,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:16:11,667 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;@479c2067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:16:11,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:16:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:16:11,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:11,678 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] [2025-03-08 07:16:11,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:11,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:11,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1330764623, now seen corresponding path program 1 times [2025-03-08 07:16:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:11,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998753761] [2025-03-08 07:16:11,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:11,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 07:16:11,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:16:11,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:11,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:11,862 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-08 07:16:11,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:11,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998753761] [2025-03-08 07:16:11,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998753761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:11,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:11,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:16:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168456468] [2025-03-08 07:16:11,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:11,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:16:11,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:11,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:16:11,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:16:11,885 INFO L87 Difference]: Start difference. First operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:11,968 INFO L93 Difference]: Finished difference Result 1742 states and 3307 transitions. [2025-03-08 07:16:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:16:11,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-08 07:16:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:11,980 INFO L225 Difference]: With dead ends: 1742 [2025-03-08 07:16:11,980 INFO L226 Difference]: Without dead ends: 821 [2025-03-08 07:16:11,985 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-08 07:16:11,988 INFO L435 NwaCegarLoop]: 1615 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, 1615 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-08 07:16:11,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-08 07:16:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2025-03-08 07:16:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.8937728937728937) internal successors, (1551), 820 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1551 transitions. [2025-03-08 07:16:12,067 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1551 transitions. Word has length 22 [2025-03-08 07:16:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,068 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1551 transitions. [2025-03-08 07:16:12,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1551 transitions. [2025-03-08 07:16:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:16:12,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,069 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] [2025-03-08 07:16:12,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:16:12,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1841298800, now seen corresponding path program 1 times [2025-03-08 07:16:12,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94068849] [2025-03-08 07:16:12,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 07:16:12,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:16:12,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,271 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-08 07:16:12,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94068849] [2025-03-08 07:16:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94068849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:16:12,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139675102] [2025-03-08 07:16:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:16:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:16:12,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:16:12,274 INFO L87 Difference]: Start difference. First operand 821 states and 1551 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:12,373 INFO L93 Difference]: Finished difference Result 863 states and 1615 transitions. [2025-03-08 07:16:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:16:12,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-08 07:16:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:12,377 INFO L225 Difference]: With dead ends: 863 [2025-03-08 07:16:12,377 INFO L226 Difference]: Without dead ends: 821 [2025-03-08 07:16:12,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:16:12,378 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:12,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6168 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-08 07:16:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2025-03-08 07:16:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.8656898656898657) internal successors, (1528), 820 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1528 transitions. [2025-03-08 07:16:12,402 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1528 transitions. Word has length 22 [2025-03-08 07:16:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,402 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1528 transitions. [2025-03-08 07:16:12,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1528 transitions. [2025-03-08 07:16:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 07:16:12,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,404 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] [2025-03-08 07:16:12,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:16:12,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash 483422138, now seen corresponding path program 1 times [2025-03-08 07:16:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407512523] [2025-03-08 07:16:12,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 07:16:12,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 07:16:12,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,578 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-08 07:16:12,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407512523] [2025-03-08 07:16:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407512523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378465981] [2025-03-08 07:16:12,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:12,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:12,582 INFO L87 Difference]: Start difference. First operand 821 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:12,739 INFO L93 Difference]: Finished difference Result 1125 states and 2008 transitions. [2025-03-08 07:16:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:16:12,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-08 07:16:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:12,743 INFO L225 Difference]: With dead ends: 1125 [2025-03-08 07:16:12,743 INFO L226 Difference]: Without dead ends: 1087 [2025-03-08 07:16:12,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:16:12,744 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 6285 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6285 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:12,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6285 Valid, 2135 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:16:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-03-08 07:16:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 857. [2025-03-08 07:16:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 855 states have (on average 1.8538011695906433) internal successors, (1585), 856 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1585 transitions. [2025-03-08 07:16:12,767 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1585 transitions. Word has length 44 [2025-03-08 07:16:12,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,767 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1585 transitions. [2025-03-08 07:16:12,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1585 transitions. [2025-03-08 07:16:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 07:16:12,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,769 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] [2025-03-08 07:16:12,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:16:12,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1832559893, now seen corresponding path program 1 times [2025-03-08 07:16:12,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753772859] [2025-03-08 07:16:12,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 07:16:12,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 07:16:12,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,853 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-08 07:16:12,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753772859] [2025-03-08 07:16:12,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753772859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:12,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161066754] [2025-03-08 07:16:12,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:12,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,855 INFO L87 Difference]: Start difference. First operand 857 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:12,885 INFO L93 Difference]: Finished difference Result 994 states and 1800 transitions. [2025-03-08 07:16:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:12,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-08 07:16:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:12,888 INFO L225 Difference]: With dead ends: 994 [2025-03-08 07:16:12,888 INFO L226 Difference]: Without dead ends: 920 [2025-03-08 07:16:12,891 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-08 07:16:12,893 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 1476 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1577 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-08 07:16:12,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1577 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-08 07:16:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 916. [2025-03-08 07:16:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8326039387308535) internal successors, (1675), 915 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1675 transitions. [2025-03-08 07:16:12,966 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1675 transitions. Word has length 46 [2025-03-08 07:16:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,966 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1675 transitions. [2025-03-08 07:16:12,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1675 transitions. [2025-03-08 07:16:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 07:16:12,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,969 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] [2025-03-08 07:16:12,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:16:12,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1864883128, now seen corresponding path program 1 times [2025-03-08 07:16:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616453086] [2025-03-08 07:16:12,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 07:16:12,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 07:16:12,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:13,153 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-08 07:16:13,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:13,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616453086] [2025-03-08 07:16:13,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616453086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:13,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:13,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:13,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620060363] [2025-03-08 07:16:13,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:13,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:13,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:13,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:13,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:13,155 INFO L87 Difference]: Start difference. First operand 916 states and 1675 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:13,239 INFO L93 Difference]: Finished difference Result 1051 states and 1883 transitions. [2025-03-08 07:16:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:13,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-08 07:16:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:13,243 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 07:16:13,243 INFO L226 Difference]: Without dead ends: 918 [2025-03-08 07:16:13,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:16:13,243 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 2974 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2974 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:13,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2974 Valid, 1693 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-08 07:16:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 916. [2025-03-08 07:16:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8304157549234135) internal successors, (1673), 915 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1673 transitions. [2025-03-08 07:16:13,259 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1673 transitions. Word has length 46 [2025-03-08 07:16:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:13,259 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1673 transitions. [2025-03-08 07:16:13,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1673 transitions. [2025-03-08 07:16:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 07:16:13,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:13,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:13,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:16:13,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2007339854, now seen corresponding path program 1 times [2025-03-08 07:16:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069672911] [2025-03-08 07:16:13,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:13,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 07:16:13,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 07:16:13,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:13,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:13,437 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-08 07:16:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069672911] [2025-03-08 07:16:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069672911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:13,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:13,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:16:13,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662566694] [2025-03-08 07:16:13,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:13,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:16:13,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:13,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:16:13,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:16:13,438 INFO L87 Difference]: Start difference. First operand 916 states and 1673 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:13,470 INFO L93 Difference]: Finished difference Result 924 states and 1682 transitions. [2025-03-08 07:16:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:16:13,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-08 07:16:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:13,473 INFO L225 Difference]: With dead ends: 924 [2025-03-08 07:16:13,473 INFO L226 Difference]: Without dead ends: 922 [2025-03-08 07:16:13,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:16:13,474 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:13,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6091 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-08 07:16:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2025-03-08 07:16:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 920 states have (on average 1.8239130434782609) internal successors, (1678), 921 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1678 transitions. [2025-03-08 07:16:13,492 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1678 transitions. Word has length 47 [2025-03-08 07:16:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:13,492 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1678 transitions. [2025-03-08 07:16:13,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1678 transitions. [2025-03-08 07:16:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:16:13,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:13,494 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] [2025-03-08 07:16:13,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:16:13,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:13,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:13,495 INFO L85 PathProgramCache]: Analyzing trace with hash 56563094, now seen corresponding path program 1 times [2025-03-08 07:16:13,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:13,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337385465] [2025-03-08 07:16:13,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:13,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:13,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:16:13,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:16:13,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:13,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:13,536 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-08 07:16:13,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337385465] [2025-03-08 07:16:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337385465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:13,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:13,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083108973] [2025-03-08 07:16:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:13,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:13,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:13,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:13,537 INFO L87 Difference]: Start difference. First operand 922 states and 1678 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:13,557 INFO L93 Difference]: Finished difference Result 1184 states and 2070 transitions. [2025-03-08 07:16:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-08 07:16:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:13,561 INFO L225 Difference]: With dead ends: 1184 [2025-03-08 07:16:13,561 INFO L226 Difference]: Without dead ends: 1045 [2025-03-08 07:16:13,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:13,562 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1487 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1630 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-08 07:16:13,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1630 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-08 07:16:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2025-03-08 07:16:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1041 states have (on average 1.781940441882805) internal successors, (1855), 1042 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1855 transitions. [2025-03-08 07:16:13,579 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1855 transitions. Word has length 48 [2025-03-08 07:16:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:13,579 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1855 transitions. [2025-03-08 07:16:13,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1855 transitions. [2025-03-08 07:16:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:16:13,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:13,580 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] [2025-03-08 07:16:13,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:16:13,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash 471738966, now seen corresponding path program 1 times [2025-03-08 07:16:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927995918] [2025-03-08 07:16:13,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:13,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:16:13,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:16:13,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:13,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:13,625 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-08 07:16:13,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:13,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927995918] [2025-03-08 07:16:13,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927995918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:13,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193451215] [2025-03-08 07:16:13,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:13,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:13,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:13,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:13,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:13,626 INFO L87 Difference]: Start difference. First operand 1043 states and 1855 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:13,647 INFO L93 Difference]: Finished difference Result 1531 states and 2573 transitions. [2025-03-08 07:16:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:13,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-08 07:16:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:13,652 INFO L225 Difference]: With dead ends: 1531 [2025-03-08 07:16:13,652 INFO L226 Difference]: Without dead ends: 1271 [2025-03-08 07:16:13,653 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-08 07:16:13,653 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1485 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1632 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-08 07:16:13,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1632 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-03-08 07:16:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2025-03-08 07:16:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1267 states have (on average 1.718232044198895) internal successors, (2177), 1268 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2177 transitions. [2025-03-08 07:16:13,677 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2177 transitions. Word has length 48 [2025-03-08 07:16:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:13,677 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 2177 transitions. [2025-03-08 07:16:13,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2177 transitions. [2025-03-08 07:16:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:16:13,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:13,678 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] [2025-03-08 07:16:13,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:16:13,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:13,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash -14979306, now seen corresponding path program 1 times [2025-03-08 07:16:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:13,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411796437] [2025-03-08 07:16:13,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:13,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:13,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:16:13,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:16:13,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:13,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:13,715 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-08 07:16:13,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411796437] [2025-03-08 07:16:13,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411796437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:13,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:13,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:13,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548958776] [2025-03-08 07:16:13,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:13,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:13,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:13,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:13,716 INFO L87 Difference]: Start difference. First operand 1269 states and 2177 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:13,741 INFO L93 Difference]: Finished difference Result 2177 states and 3483 transitions. [2025-03-08 07:16:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:13,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-08 07:16:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:13,747 INFO L225 Difference]: With dead ends: 2177 [2025-03-08 07:16:13,747 INFO L226 Difference]: Without dead ends: 1691 [2025-03-08 07:16:13,748 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-08 07:16:13,748 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1483 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1634 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-08 07:16:13,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1634 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2025-03-08 07:16:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1689. [2025-03-08 07:16:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.6342620035566093) internal successors, (2757), 1688 states have internal predecessors, (2757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2757 transitions. [2025-03-08 07:16:13,779 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2757 transitions. Word has length 48 [2025-03-08 07:16:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:13,780 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2757 transitions. [2025-03-08 07:16:13,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2757 transitions. [2025-03-08 07:16:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 07:16:13,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:13,780 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] [2025-03-08 07:16:13,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:16:13,781 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:13,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2144209802, now seen corresponding path program 1 times [2025-03-08 07:16:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:13,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479116006] [2025-03-08 07:16:13,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:13,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:13,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 07:16:13,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 07:16:13,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:13,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:13,819 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-08 07:16:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479116006] [2025-03-08 07:16:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479116006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:13,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:13,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:13,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756926383] [2025-03-08 07:16:13,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:13,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:13,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:13,821 INFO L87 Difference]: Start difference. First operand 1689 states and 2757 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:13,849 INFO L93 Difference]: Finished difference Result 2656 states and 4155 transitions. [2025-03-08 07:16:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-08 07:16:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:13,855 INFO L225 Difference]: With dead ends: 2656 [2025-03-08 07:16:13,855 INFO L226 Difference]: Without dead ends: 2125 [2025-03-08 07:16:13,857 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-08 07:16:13,857 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 1486 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1631 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-08 07:16:13,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2025-03-08 07:16:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2123. [2025-03-08 07:16:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 2121 states have (on average 1.5836869401225837) internal successors, (3359), 2122 states have internal predecessors, (3359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 3359 transitions. [2025-03-08 07:16:13,900 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 3359 transitions. Word has length 50 [2025-03-08 07:16:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:13,900 INFO L471 AbstractCegarLoop]: Abstraction has 2123 states and 3359 transitions. [2025-03-08 07:16:13,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3359 transitions. [2025-03-08 07:16:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 07:16:13,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:13,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:13,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:16:13,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:13,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:13,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1995115786, now seen corresponding path program 1 times [2025-03-08 07:16:13,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:13,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311271703] [2025-03-08 07:16:13,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:13,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:13,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 07:16:13,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 07:16:13,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:13,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:14,009 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-08 07:16:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:14,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311271703] [2025-03-08 07:16:14,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311271703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:14,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:14,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:14,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767662313] [2025-03-08 07:16:14,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:14,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:16:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:14,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:16:14,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:16:14,011 INFO L87 Difference]: Start difference. First operand 2123 states and 3359 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:18,464 INFO L93 Difference]: Finished difference Result 4378 states and 7668 transitions. [2025-03-08 07:16:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:16:18,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 07:16:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:18,475 INFO L225 Difference]: With dead ends: 4378 [2025-03-08 07:16:18,476 INFO L226 Difference]: Without dead ends: 3625 [2025-03-08 07:16:18,477 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-08 07:16:18,478 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 2359 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2359 SdHoareTripleChecker+Valid, 800 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:18,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2359 Valid, 800 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 07:16:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2025-03-08 07:16:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 3625. [2025-03-08 07:16:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 3623 states have (on average 1.5139387248136904) internal successors, (5485), 3624 states have internal predecessors, (5485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5485 transitions. [2025-03-08 07:16:18,537 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5485 transitions. Word has length 60 [2025-03-08 07:16:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:18,538 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5485 transitions. [2025-03-08 07:16:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5485 transitions. [2025-03-08 07:16:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:16:18,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:18,541 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] [2025-03-08 07:16:18,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:16:18,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1690582205, now seen corresponding path program 1 times [2025-03-08 07:16:18,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873041566] [2025-03-08 07:16:18,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:18,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:16:18,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:16:18,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:18,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:16:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873041566] [2025-03-08 07:16:18,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873041566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:18,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:18,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:18,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037684242] [2025-03-08 07:16:18,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:18,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:18,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:18,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:18,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:18,647 INFO L87 Difference]: Start difference. First operand 3625 states and 5485 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:18,781 INFO L93 Difference]: Finished difference Result 9275 states and 13442 transitions. [2025-03-08 07:16:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 07:16:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:18,805 INFO L225 Difference]: With dead ends: 9275 [2025-03-08 07:16:18,805 INFO L226 Difference]: Without dead ends: 7937 [2025-03-08 07:16:18,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:16:18,811 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 4663 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4663 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:18,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4663 Valid, 3368 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:16:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7937 states. [2025-03-08 07:16:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7937 to 4961. [2025-03-08 07:16:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4961 states, 4959 states have (on average 1.481952006452914) internal successors, (7349), 4960 states have internal predecessors, (7349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4961 states to 4961 states and 7349 transitions. [2025-03-08 07:16:18,911 INFO L78 Accepts]: Start accepts. Automaton has 4961 states and 7349 transitions. Word has length 65 [2025-03-08 07:16:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:18,911 INFO L471 AbstractCegarLoop]: Abstraction has 4961 states and 7349 transitions. [2025-03-08 07:16:18,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4961 states and 7349 transitions. [2025-03-08 07:16:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:16:18,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:18,912 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] [2025-03-08 07:16:18,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:16:18,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:18,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2105758077, now seen corresponding path program 1 times [2025-03-08 07:16:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:18,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740254636] [2025-03-08 07:16:18,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:18,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:16:18,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:16:18,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:18,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 07:16:19,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:19,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740254636] [2025-03-08 07:16:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740254636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:19,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:19,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251404423] [2025-03-08 07:16:19,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:19,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:19,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:19,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:19,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:19,014 INFO L87 Difference]: Start difference. First operand 4961 states and 7349 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:19,161 INFO L93 Difference]: Finished difference Result 10611 states and 15306 transitions. [2025-03-08 07:16:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:19,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 65 [2025-03-08 07:16:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:19,186 INFO L225 Difference]: With dead ends: 10611 [2025-03-08 07:16:19,186 INFO L226 Difference]: Without dead ends: 9273 [2025-03-08 07:16:19,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:16:19,191 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 4688 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:19,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 3318 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2025-03-08 07:16:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 6969. [2025-03-08 07:16:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6969 states, 6967 states have (on average 1.4532797473805081) internal successors, (10125), 6968 states have internal predecessors, (10125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6969 states to 6969 states and 10125 transitions. [2025-03-08 07:16:19,414 INFO L78 Accepts]: Start accepts. Automaton has 6969 states and 10125 transitions. Word has length 65 [2025-03-08 07:16:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:19,414 INFO L471 AbstractCegarLoop]: Abstraction has 6969 states and 10125 transitions. [2025-03-08 07:16:19,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 6969 states and 10125 transitions. [2025-03-08 07:16:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:16:19,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:19,416 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] [2025-03-08 07:16:19,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:16:19,416 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:19,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1619039805, now seen corresponding path program 1 times [2025-03-08 07:16:19,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:19,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818707516] [2025-03-08 07:16:19,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:19,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:16:19,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:16:19,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:19,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:16:19,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:19,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818707516] [2025-03-08 07:16:19,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818707516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:19,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308441177] [2025-03-08 07:16:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:19,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:19,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:19,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:19,520 INFO L87 Difference]: Start difference. First operand 6969 states and 10125 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:19,696 INFO L93 Difference]: Finished difference Result 11947 states and 17170 transitions. [2025-03-08 07:16:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:19,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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 65 [2025-03-08 07:16:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:19,714 INFO L225 Difference]: With dead ends: 11947 [2025-03-08 07:16:19,714 INFO L226 Difference]: Without dead ends: 10609 [2025-03-08 07:16:19,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:16:19,720 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 4677 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4677 SdHoareTripleChecker+Valid, 3324 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:19,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4677 Valid, 3324 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:16:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10609 states. [2025-03-08 07:16:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10609 to 8305. [2025-03-08 07:16:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8305 states, 8303 states have (on average 1.4439359267734553) internal successors, (11989), 8304 states have internal predecessors, (11989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8305 states to 8305 states and 11989 transitions. [2025-03-08 07:16:19,863 INFO L78 Accepts]: Start accepts. Automaton has 8305 states and 11989 transitions. Word has length 65 [2025-03-08 07:16:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:19,863 INFO L471 AbstractCegarLoop]: Abstraction has 8305 states and 11989 transitions. [2025-03-08 07:16:19,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 8305 states and 11989 transitions. [2025-03-08 07:16:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:16:19,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:19,865 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] [2025-03-08 07:16:19,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:16:19,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:19,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1990429701, now seen corresponding path program 1 times [2025-03-08 07:16:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431140435] [2025-03-08 07:16:19,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:19,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:16:19,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:16:19,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:19,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431140435] [2025-03-08 07:16:19,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431140435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:19,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:19,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767779981] [2025-03-08 07:16:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:19,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:19,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:19,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:19,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:19,928 INFO L87 Difference]: Start difference. First operand 8305 states and 11989 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:19,988 INFO L93 Difference]: Finished difference Result 12647 states and 18130 transitions. [2025-03-08 07:16:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-08 07:16:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:19,999 INFO L225 Difference]: With dead ends: 12647 [2025-03-08 07:16:20,000 INFO L226 Difference]: Without dead ends: 6629 [2025-03-08 07:16:20,006 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-08 07:16:20,007 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 42 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3073 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-08 07:16:20,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3073 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6629 states. [2025-03-08 07:16:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6629 to 6627. [2025-03-08 07:16:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6627 states, 6625 states have (on average 1.4585660377358491) internal successors, (9663), 6626 states have internal predecessors, (9663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 9663 transitions. [2025-03-08 07:16:20,188 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 9663 transitions. Word has length 67 [2025-03-08 07:16:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:20,189 INFO L471 AbstractCegarLoop]: Abstraction has 6627 states and 9663 transitions. [2025-03-08 07:16:20,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 9663 transitions. [2025-03-08 07:16:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:16:20,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:20,191 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] [2025-03-08 07:16:20,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:16:20,191 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:20,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash 485092829, now seen corresponding path program 1 times [2025-03-08 07:16:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:20,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81070590] [2025-03-08 07:16:20,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:20,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:20,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:16:20,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:16:20,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:20,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:16:20,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81070590] [2025-03-08 07:16:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81070590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:20,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006483647] [2025-03-08 07:16:20,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:20,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:20,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:20,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:20,302 INFO L87 Difference]: Start difference. First operand 6627 states and 9663 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-08 07:16:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:20,489 INFO L93 Difference]: Finished difference Result 10477 states and 15108 transitions. [2025-03-08 07:16:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:20,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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 67 [2025-03-08 07:16:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:20,507 INFO L225 Difference]: With dead ends: 10477 [2025-03-08 07:16:20,508 INFO L226 Difference]: Without dead ends: 9515 [2025-03-08 07:16:20,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:16:20,514 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4667 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:20,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3393 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9515 states. [2025-03-08 07:16:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9515 to 7587. [2025-03-08 07:16:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7587 states, 7585 states have (on average 1.4511535926170072) internal successors, (11007), 7586 states have internal predecessors, (11007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7587 states to 7587 states and 11007 transitions. [2025-03-08 07:16:20,679 INFO L78 Accepts]: Start accepts. Automaton has 7587 states and 11007 transitions. Word has length 67 [2025-03-08 07:16:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:20,679 INFO L471 AbstractCegarLoop]: Abstraction has 7587 states and 11007 transitions. [2025-03-08 07:16:20,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-08 07:16:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7587 states and 11007 transitions. [2025-03-08 07:16:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:16:20,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:20,681 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] [2025-03-08 07:16:20,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:16:20,681 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:20,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:20,681 INFO L85 PathProgramCache]: Analyzing trace with hash 317371601, now seen corresponding path program 1 times [2025-03-08 07:16:20,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:20,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770690058] [2025-03-08 07:16:20,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:20,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:20,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:16:20,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:16:20,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:20,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:20,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:20,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770690058] [2025-03-08 07:16:20,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770690058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:20,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:20,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:20,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712704979] [2025-03-08 07:16:20,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:20,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:20,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:20,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:20,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:20,754 INFO L87 Difference]: Start difference. First operand 7587 states and 11007 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-08 07:16:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:20,798 INFO L93 Difference]: Finished difference Result 10231 states and 14705 transitions. [2025-03-08 07:16:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:20,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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 68 [2025-03-08 07:16:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:20,810 INFO L225 Difference]: With dead ends: 10231 [2025-03-08 07:16:20,810 INFO L226 Difference]: Without dead ends: 4949 [2025-03-08 07:16:20,815 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-08 07:16:20,816 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 37 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 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-08 07:16:20,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2025-03-08 07:16:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4947. [2025-03-08 07:16:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4947 states, 4945 states have (on average 1.4695652173913043) internal successors, (7267), 4946 states have internal predecessors, (7267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 7267 transitions. [2025-03-08 07:16:20,881 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 7267 transitions. Word has length 68 [2025-03-08 07:16:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:20,881 INFO L471 AbstractCegarLoop]: Abstraction has 4947 states and 7267 transitions. [2025-03-08 07:16:20,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-08 07:16:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 7267 transitions. [2025-03-08 07:16:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 07:16:20,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:20,882 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] [2025-03-08 07:16:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:16:20,883 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:20,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1409098024, now seen corresponding path program 1 times [2025-03-08 07:16:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572888319] [2025-03-08 07:16:20,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:20,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:20,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 07:16:20,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 07:16:20,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:20,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:20,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572888319] [2025-03-08 07:16:20,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572888319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:20,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:20,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674332626] [2025-03-08 07:16:20,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:20,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:20,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:20,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:20,944 INFO L87 Difference]: Start difference. First operand 4947 states and 7267 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-08 07:16:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:20,974 INFO L93 Difference]: Finished difference Result 6271 states and 9095 transitions. [2025-03-08 07:16:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 70 [2025-03-08 07:16:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:20,980 INFO L225 Difference]: With dead ends: 6271 [2025-03-08 07:16:20,980 INFO L226 Difference]: Without dead ends: 3629 [2025-03-08 07:16:20,983 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-08 07:16:20,983 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 34 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3043 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-08 07:16:20,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3043 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2025-03-08 07:16:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3627. [2025-03-08 07:16:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3627 states, 3625 states have (on average 1.494896551724138) internal successors, (5419), 3626 states have internal predecessors, (5419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 5419 transitions. [2025-03-08 07:16:21,026 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 5419 transitions. Word has length 70 [2025-03-08 07:16:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:21,026 INFO L471 AbstractCegarLoop]: Abstraction has 3627 states and 5419 transitions. [2025-03-08 07:16:21,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-08 07:16:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 5419 transitions. [2025-03-08 07:16:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 07:16:21,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:21,027 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] [2025-03-08 07:16:21,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:16:21,027 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:21,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash -505296385, now seen corresponding path program 1 times [2025-03-08 07:16:21,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630686728] [2025-03-08 07:16:21,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:21,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 07:16:21,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 07:16:21,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:21,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:21,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:21,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630686728] [2025-03-08 07:16:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630686728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:21,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:21,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616283574] [2025-03-08 07:16:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:21,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:21,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:21,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:21,083 INFO L87 Difference]: Start difference. First operand 3627 states and 5419 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:21,106 INFO L93 Difference]: Finished difference Result 4291 states and 6323 transitions. [2025-03-08 07:16:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:21,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-03-08 07:16:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:21,113 INFO L225 Difference]: With dead ends: 4291 [2025-03-08 07:16:21,113 INFO L226 Difference]: Without dead ends: 2969 [2025-03-08 07:16:21,114 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-08 07:16:21,115 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 31 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3028 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-08 07:16:21,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3028 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2025-03-08 07:16:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2967. [2025-03-08 07:16:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 2965 states have (on average 1.5197301854974705) internal successors, (4506), 2966 states have internal predecessors, (4506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 4506 transitions. [2025-03-08 07:16:21,167 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 4506 transitions. Word has length 72 [2025-03-08 07:16:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:21,168 INFO L471 AbstractCegarLoop]: Abstraction has 2967 states and 4506 transitions. [2025-03-08 07:16:21,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 4506 transitions. [2025-03-08 07:16:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 07:16:21,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:21,170 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] [2025-03-08 07:16:21,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:16:21,171 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:21,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash 163046982, now seen corresponding path program 1 times [2025-03-08 07:16:21,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:21,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444322909] [2025-03-08 07:16:21,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:21,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:21,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 07:16:21,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 07:16:21,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:21,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444322909] [2025-03-08 07:16:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444322909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:16:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252288798] [2025-03-08 07:16:22,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:22,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:16:22,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:16:22,364 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-08 07:16:22,366 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-08 07:16:22,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 07:16:22,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 07:16:22,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:22,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:22,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 07:16:22,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:16:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:22,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:16:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252288798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:16:22,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:16:22,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-08 07:16:22,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958342428] [2025-03-08 07:16:22,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:16:22,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 07:16:22,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:23,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 07:16:23,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:16:23,000 INFO L87 Difference]: Start difference. First operand 2967 states and 4506 transitions. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:26,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:26,277 INFO L93 Difference]: Finished difference Result 9023 states and 12554 transitions. [2025-03-08 07:16:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-08 07:16:26,278 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 07:16:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:26,292 INFO L225 Difference]: With dead ends: 9023 [2025-03-08 07:16:26,292 INFO L226 Difference]: Without dead ends: 8287 [2025-03-08 07:16:26,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-08 07:16:26,297 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 10271 mSDsluCounter, 9552 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10271 SdHoareTripleChecker+Valid, 11069 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:26,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10271 Valid, 11069 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:16:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2025-03-08 07:16:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 7789. [2025-03-08 07:16:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7789 states, 7787 states have (on average 1.3837164504944137) internal successors, (10775), 7788 states have internal predecessors, (10775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7789 states to 7789 states and 10775 transitions. [2025-03-08 07:16:26,434 INFO L78 Accepts]: Start accepts. Automaton has 7789 states and 10775 transitions. Word has length 74 [2025-03-08 07:16:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:26,435 INFO L471 AbstractCegarLoop]: Abstraction has 7789 states and 10775 transitions. [2025-03-08 07:16:26,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 7789 states and 10775 transitions. [2025-03-08 07:16:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 07:16:26,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:26,438 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] [2025-03-08 07:16:26,448 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-08 07:16:26,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:16:26,640 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1032286997, now seen corresponding path program 1 times [2025-03-08 07:16:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626661510] [2025-03-08 07:16:26,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:26,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:16:26,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:16:26,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:26,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:26,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626661510] [2025-03-08 07:16:26,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626661510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:16:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881264221] [2025-03-08 07:16:26,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:26,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:16:26,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:16:26,961 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-08 07:16:26,963 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-08 07:16:27,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:16:27,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:16:27,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:27,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:27,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 07:16:27,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:16:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:27,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:16:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:28,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881264221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:16:28,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:16:28,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-03-08 07:16:28,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343500280] [2025-03-08 07:16:28,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:16:28,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 07:16:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:28,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 07:16:28,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2025-03-08 07:16:28,372 INFO L87 Difference]: Start difference. First operand 7789 states and 10775 transitions. Second operand has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:31,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:31,180 INFO L93 Difference]: Finished difference Result 38646 states and 50959 transitions. [2025-03-08 07:16:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-08 07:16:31,181 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 states have internal predecessors, (189), 0 states have call successors, (0), 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-08 07:16:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:31,225 INFO L225 Difference]: With dead ends: 38646 [2025-03-08 07:16:31,225 INFO L226 Difference]: Without dead ends: 33178 [2025-03-08 07:16:31,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1255, Invalid=5551, Unknown=0, NotChecked=0, Total=6806 [2025-03-08 07:16:31,235 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 19564 mSDsluCounter, 10985 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19564 SdHoareTripleChecker+Valid, 12485 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:31,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19564 Valid, 12485 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:16:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33178 states. [2025-03-08 07:16:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33178 to 15092. [2025-03-08 07:16:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15092 states, 15090 states have (on average 1.330881378396289) internal successors, (20083), 15091 states have internal predecessors, (20083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15092 states to 15092 states and 20083 transitions. [2025-03-08 07:16:31,751 INFO L78 Accepts]: Start accepts. Automaton has 15092 states and 20083 transitions. Word has length 75 [2025-03-08 07:16:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:31,751 INFO L471 AbstractCegarLoop]: Abstraction has 15092 states and 20083 transitions. [2025-03-08 07:16:31,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:16:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 15092 states and 20083 transitions. [2025-03-08 07:16:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:16:31,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:31,753 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] [2025-03-08 07:16:31,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:16:31,953 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,SelfDestructingSolverStorable20 [2025-03-08 07:16:31,954 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:31,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1144465886, now seen corresponding path program 1 times [2025-03-08 07:16:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:31,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425549240] [2025-03-08 07:16:31,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:31,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:16:31,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:16:31,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:31,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:32,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:32,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425549240] [2025-03-08 07:16:32,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425549240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:16:32,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914826669] [2025-03-08 07:16:32,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:32,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:16:32,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:16:32,371 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-08 07:16:32,373 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-08 07:16:32,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:16:32,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:16:32,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:32,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:32,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 07:16:32,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:16:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:34,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:16:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:36,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914826669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:16:36,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:16:36,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 16] total 41 [2025-03-08 07:16:36,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621749162] [2025-03-08 07:16:36,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:16:36,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 07:16:36,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:36,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 07:16:36,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1479, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 07:16:36,127 INFO L87 Difference]: Start difference. First operand 15092 states and 20083 transitions. Second operand has 41 states, 41 states have (on average 5.073170731707317) internal successors, (208), 41 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:17:04,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:17:04,406 INFO L93 Difference]: Finished difference Result 80204 states and 104044 transitions. [2025-03-08 07:17:04,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2025-03-08 07:17:04,407 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 5.073170731707317) internal successors, (208), 41 states have internal predecessors, (208), 0 states have call successors, (0), 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-08 07:17:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:17:04,494 INFO L225 Difference]: With dead ends: 80204 [2025-03-08 07:17:04,495 INFO L226 Difference]: Without dead ends: 67733 [2025-03-08 07:17:04,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26372 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=8526, Invalid=56244, Unknown=0, NotChecked=0, Total=64770 [2025-03-08 07:17:04,518 INFO L435 NwaCegarLoop]: 1529 mSDtfsCounter, 35532 mSDsluCounter, 19509 mSDsCounter, 0 mSdLazyCounter, 2946 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35532 SdHoareTripleChecker+Valid, 21038 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 2946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:17:04,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35532 Valid, 21038 Invalid, 3141 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [195 Valid, 2946 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 07:17:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67733 states. [2025-03-08 07:17:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67733 to 25352. [2025-03-08 07:17:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25352 states, 25350 states have (on average 1.3019329388560157) internal successors, (33004), 25351 states have internal predecessors, (33004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:17:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25352 states to 25352 states and 33004 transitions. [2025-03-08 07:17:05,921 INFO L78 Accepts]: Start accepts. Automaton has 25352 states and 33004 transitions. Word has length 76 [2025-03-08 07:17:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:17:05,922 INFO L471 AbstractCegarLoop]: Abstraction has 25352 states and 33004 transitions. [2025-03-08 07:17:05,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 5.073170731707317) internal successors, (208), 41 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:17:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 25352 states and 33004 transitions. [2025-03-08 07:17:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:17:05,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:17:05,923 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] [2025-03-08 07:17:05,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:17:06,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:17:06,125 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:17:06,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:17:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1286826896, now seen corresponding path program 1 times [2025-03-08 07:17:06,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:17:06,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704838850] [2025-03-08 07:17:06,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:17:06,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:17:06,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:17:06,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:06,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:06,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:17:06,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704838850] [2025-03-08 07:17:06,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704838850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:17:06,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524967717] [2025-03-08 07:17:06,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:06,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:17:06,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:17:06,745 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-08 07:17:06,747 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-08 07:17:06,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:17:06,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:17:06,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:06,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:06,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 07:17:06,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:17:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:07,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:17:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:08,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524967717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:17:08,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:17:08,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2025-03-08 07:17:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146316094] [2025-03-08 07:17:08,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:17:08,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 07:17:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:17:08,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 07:17:08,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2025-03-08 07:17:08,233 INFO L87 Difference]: Start difference. First operand 25352 states and 33004 transitions. Second operand has 32 states, 32 states have (on average 6.53125) internal successors, (209), 32 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:17:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:17:11,139 INFO L93 Difference]: Finished difference Result 52412 states and 66790 transitions. [2025-03-08 07:17:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 07:17:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.53125) internal successors, (209), 32 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 07:17:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:17:11,196 INFO L225 Difference]: With dead ends: 52412 [2025-03-08 07:17:11,196 INFO L226 Difference]: Without dead ends: 43435 [2025-03-08 07:17:11,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=481, Invalid=1969, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 07:17:11,214 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 9673 mSDsluCounter, 15624 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9673 SdHoareTripleChecker+Valid, 17132 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:17:11,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9673 Valid, 17132 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:17:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43435 states. [2025-03-08 07:17:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43435 to 30065. [2025-03-08 07:17:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30065 states, 30063 states have (on average 1.2909556597811263) internal successors, (38810), 30064 states have internal predecessors, (38810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:17:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30065 states to 30065 states and 38810 transitions. [2025-03-08 07:17:12,390 INFO L78 Accepts]: Start accepts. Automaton has 30065 states and 38810 transitions. Word has length 77 [2025-03-08 07:17:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:17:12,390 INFO L471 AbstractCegarLoop]: Abstraction has 30065 states and 38810 transitions. [2025-03-08 07:17:12,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.53125) internal successors, (209), 32 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:17:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 30065 states and 38810 transitions. [2025-03-08 07:17:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:17:12,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:17:12,391 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] [2025-03-08 07:17:12,398 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-08 07:17:12,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:17:12,592 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:17:12,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:17:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1428629506, now seen corresponding path program 1 times [2025-03-08 07:17:12,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:17:12,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595298678] [2025-03-08 07:17:12,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:17:12,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:17:12,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:17:12,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:12,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:13,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:17:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595298678] [2025-03-08 07:17:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595298678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:17:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968510683] [2025-03-08 07:17:13,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:13,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:17:13,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:17:13,959 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-08 07:17:13,960 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-08 07:17:14,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:17:14,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:17:14,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:14,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:14,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 07:17:14,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:17:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:14,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:17:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968510683] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:17:15,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:17:15,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2025-03-08 07:17:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866113055] [2025-03-08 07:17:15,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:17:15,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 07:17:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:17:15,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 07:17:15,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1900, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 07:17:15,482 INFO L87 Difference]: Start difference. First operand 30065 states and 38810 transitions. Second operand has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 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-08 07:17:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:17:26,141 INFO L93 Difference]: Finished difference Result 75518 states and 96715 transitions. [2025-03-08 07:17:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-03-08 07:17:26,142 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 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 78 [2025-03-08 07:17:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:17:26,202 INFO L225 Difference]: With dead ends: 75518 [2025-03-08 07:17:26,202 INFO L226 Difference]: Without dead ends: 59644 [2025-03-08 07:17:26,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4922 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3561, Invalid=13731, Unknown=0, NotChecked=0, Total=17292 [2025-03-08 07:17:26,218 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 22893 mSDsluCounter, 24332 mSDsCounter, 0 mSdLazyCounter, 3259 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22893 SdHoareTripleChecker+Valid, 25887 SdHoareTripleChecker+Invalid, 3345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 3259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:17:26,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22893 Valid, 25887 Invalid, 3345 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [86 Valid, 3259 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 07:17:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59644 states. [2025-03-08 07:17:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59644 to 20014. [2025-03-08 07:17:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20014 states, 20012 states have (on average 1.3085148910653608) internal successors, (26186), 20013 states have internal predecessors, (26186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:17:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 26186 transitions. [2025-03-08 07:17:27,469 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 26186 transitions. Word has length 78 [2025-03-08 07:17:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:17:27,470 INFO L471 AbstractCegarLoop]: Abstraction has 20014 states and 26186 transitions. [2025-03-08 07:17:27,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 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-08 07:17:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 26186 transitions. [2025-03-08 07:17:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:17:27,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:17:27,470 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] [2025-03-08 07:17:27,477 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-08 07:17:27,671 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,SelfDestructingSolverStorable23 [2025-03-08 07:17:27,671 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:17:27,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:17:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1318695757, now seen corresponding path program 1 times [2025-03-08 07:17:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:17:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131866895] [2025-03-08 07:17:27,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:17:27,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:17:27,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:17:27,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:27,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:28,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:17:28,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131866895] [2025-03-08 07:17:28,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131866895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:17:28,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956996520] [2025-03-08 07:17:28,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:28,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:17:28,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:17:28,193 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-08 07:17:28,244 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-08 07:17:28,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:17:28,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:17:28,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:28,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:28,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 07:17:28,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:17:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:30,479 INFO L312 TraceCheckSpWp]: Computing backward predicates...