./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.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_overflow.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 cbe797ede424f1ab8a64d91092275cecbbdb84c9d61e688c522ae0087e29fe1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:18:52,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:18:52,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:18:52,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:18:52,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:18:52,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:18:52,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:18:52,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:18:52,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:18:52,204 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:18:52,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:18:52,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:18:52,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:18:52,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:18:52,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:18:52,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:18:52,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:18:52,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:18:52,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:18:52,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:18:52,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:18:52,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:18:52,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:18:52,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:18:52,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:18:52,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:18:52,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:18:52,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:18:52,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:18:52,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:18:52,208 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 -> cbe797ede424f1ab8a64d91092275cecbbdb84c9d61e688c522ae0087e29fe1c [2025-03-08 07:18:52,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:18:52,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:18:52,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:18:52,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:18:52,488 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:18:52,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:18:53,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769ccb22e/ab72976576514e96ae17b42b8beecf42/FLAG5f54769a2 [2025-03-08 07:18:54,055 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:18:54,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:18:54,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769ccb22e/ab72976576514e96ae17b42b8beecf42/FLAG5f54769a2 [2025-03-08 07:18:54,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769ccb22e/ab72976576514e96ae17b42b8beecf42 [2025-03-08 07:18:54,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:18:54,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:18:54,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:18:54,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:18:54,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:18:54,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:18:54" (1/1) ... [2025-03-08 07:18:54,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72dae34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:54, skipping insertion in model container [2025-03-08 07:18:54,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:18:54" (1/1) ... [2025-03-08 07:18:54,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:18:54,520 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[8786,8799] [2025-03-08 07:18:54,578 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[15722,15735] [2025-03-08 07:18:54,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:18:54,970 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:18:54,993 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[8786,8799] [2025-03-08 07:18:54,998 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_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[15722,15735] [2025-03-08 07:18:55,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:18:55,326 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:18:55,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55 WrapperNode [2025-03-08 07:18:55,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:18:55,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:18:55,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:18:55,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:18:55,333 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:18:55" (1/1) ... [2025-03-08 07:18:55,381 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:18:55" (1/1) ... [2025-03-08 07:18:55,605 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5031 [2025-03-08 07:18:55,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:18:55,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:18:55,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:18:55,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:18:55,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,764 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:18:55,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:18:55,941 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:18:55,941 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:18:55,941 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:18:55,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 07:18:55,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:18:55,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:18:55,966 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:18:55,968 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:18:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:18:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:18:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:18:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:18:56,052 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:18:56,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:18:59,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5024: havoc calculate_output3_#t~ret35#1; [2025-03-08 07:18:59,359 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc calculate_output_#t~ret33#1; [2025-03-08 07:18:59,360 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3534: havoc calculate_output2_#t~ret34#1; [2025-03-08 07:18:59,488 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-03-08 07:18:59,488 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:18:59,519 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:18:59,523 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:18:59,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:18:59 BoogieIcfgContainer [2025-03-08 07:18:59,524 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:18:59,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:18:59,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:18:59,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:18:59,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:18:54" (1/3) ... [2025-03-08 07:18:59,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7182e952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:18:59, skipping insertion in model container [2025-03-08 07:18:59,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (2/3) ... [2025-03-08 07:18:59,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7182e952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:18:59, skipping insertion in model container [2025-03-08 07:18:59,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:18:59" (3/3) ... [2025-03-08 07:18:59,531 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:18:59,545 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:18:59,548 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:18:59,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:18:59,628 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;@5d36ac6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:18:59,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:18:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 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:18:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:18:59,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:18:59,642 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:18:59,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:18:59,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:18:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1657989458, now seen corresponding path program 1 times [2025-03-08 07:18:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:18:59,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478282697] [2025-03-08 07:18:59,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:18:59,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:18:59,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 07:18:59,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:18:59,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:18:59,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:18:59,823 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:18:59,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:18:59,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478282697] [2025-03-08 07:18:59,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478282697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:18:59,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:18:59,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:18:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256171735] [2025-03-08 07:18:59,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:18:59,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:18:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:18:59,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:18:59,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:18:59,845 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 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) 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:18:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:18:59,912 INFO L93 Difference]: Finished difference Result 1738 states and 3301 transitions. [2025-03-08 07:18:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:18:59,913 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:18:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:18:59,924 INFO L225 Difference]: With dead ends: 1738 [2025-03-08 07:18:59,924 INFO L226 Difference]: Without dead ends: 819 [2025-03-08 07:18:59,928 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:18:59,930 INFO L435 NwaCegarLoop]: 1612 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, 1612 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:18:59,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:18:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-08 07:18:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-03-08 07:19:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.894736842105263) internal successors, (1548), 818 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:19:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1548 transitions. [2025-03-08 07:19:00,018 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1548 transitions. Word has length 22 [2025-03-08 07:19:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:00,018 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1548 transitions. [2025-03-08 07:19:00,018 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:19:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1548 transitions. [2025-03-08 07:19:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:19:00,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:00,019 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:19:00,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:19:00,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:00,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1147455281, now seen corresponding path program 1 times [2025-03-08 07:19:00,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:00,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572182970] [2025-03-08 07:19:00,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:00,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 07:19:00,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:19:00,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:00,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:00,243 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:19:00,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:00,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572182970] [2025-03-08 07:19:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572182970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:00,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:00,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:19:00,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636244179] [2025-03-08 07:19:00,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:00,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:19:00,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:00,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:19:00,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:19:00,244 INFO L87 Difference]: Start difference. First operand 819 states and 1548 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:19:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:00,325 INFO L93 Difference]: Finished difference Result 859 states and 1609 transitions. [2025-03-08 07:19:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:19:00,325 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:19:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:00,329 INFO L225 Difference]: With dead ends: 859 [2025-03-08 07:19:00,329 INFO L226 Difference]: Without dead ends: 819 [2025-03-08 07:19:00,331 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:19:00,332 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 0 mSDsluCounter, 4610 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6156 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:19:00,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6156 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-08 07:19:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-03-08 07:19:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.8665850673194615) internal successors, (1525), 818 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states 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:19:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1525 transitions. [2025-03-08 07:19:00,358 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1525 transitions. Word has length 22 [2025-03-08 07:19:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:00,358 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1525 transitions. [2025-03-08 07:19:00,358 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:19:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1525 transitions. [2025-03-08 07:19:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 07:19:00,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:00,361 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:19:00,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:19:00,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:00,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1619243067, now seen corresponding path program 1 times [2025-03-08 07:19:00,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:00,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570081722] [2025-03-08 07:19:00,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:00,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 07:19:00,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 07:19:00,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:00,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:00,534 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:19:00,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:00,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570081722] [2025-03-08 07:19:00,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570081722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:00,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:00,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:19:00,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352541486] [2025-03-08 07:19:00,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:00,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:19:00,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:00,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:19:00,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:19:00,535 INFO L87 Difference]: Start difference. First operand 819 states and 1525 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:19:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:00,700 INFO L93 Difference]: Finished difference Result 1107 states and 1981 transitions. [2025-03-08 07:19:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:19:00,701 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:19:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:00,705 INFO L225 Difference]: With dead ends: 1107 [2025-03-08 07:19:00,706 INFO L226 Difference]: Without dead ends: 1071 [2025-03-08 07:19:00,707 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:19:00,708 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 6217 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:00,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6217 Valid, 2309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:19:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-08 07:19:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 853. [2025-03-08 07:19:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8554641598119859) internal successors, (1579), 852 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1579 transitions. [2025-03-08 07:19:00,739 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1579 transitions. Word has length 44 [2025-03-08 07:19:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:00,739 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1579 transitions. [2025-03-08 07:19:00,739 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:19:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1579 transitions. [2025-03-08 07:19:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 07:19:00,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:00,740 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:19:00,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:19:00,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:00,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:00,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1860187818, now seen corresponding path program 1 times [2025-03-08 07:19:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:00,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699985374] [2025-03-08 07:19:00,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:00,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:00,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 07:19:00,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 07:19:00,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:00,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:00,827 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:19:00,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:00,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699985374] [2025-03-08 07:19:00,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699985374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:00,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:00,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528060555] [2025-03-08 07:19:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:00,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:00,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:00,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:00,830 INFO L87 Difference]: Start difference. First operand 853 states and 1579 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:19:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:00,863 INFO L93 Difference]: Finished difference Result 982 states and 1782 transitions. [2025-03-08 07:19:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:00,864 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:19:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:00,867 INFO L225 Difference]: With dead ends: 982 [2025-03-08 07:19:00,867 INFO L226 Difference]: Without dead ends: 912 [2025-03-08 07:19:00,868 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:19:00,870 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:00,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1575 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-08 07:19:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-03-08 07:19:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states 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:19:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-03-08 07:19:00,895 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 46 [2025-03-08 07:19:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:00,896 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-03-08 07:19:00,896 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:19:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-03-08 07:19:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 07:19:00,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:00,897 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:19:00,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:19:00,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:00,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1827864583, now seen corresponding path program 1 times [2025-03-08 07:19:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:00,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048911600] [2025-03-08 07:19:00,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:00,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:00,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 07:19:00,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 07:19:00,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:00,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:01,134 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:19:01,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:01,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048911600] [2025-03-08 07:19:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048911600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:01,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:01,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:19:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027040828] [2025-03-08 07:19:01,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:01,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:19:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:01,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:19:01,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:19:01,136 INFO L87 Difference]: Start difference. First operand 910 states and 1667 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:19:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:01,244 INFO L93 Difference]: Finished difference Result 1039 states and 1867 transitions. [2025-03-08 07:19:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:19:01,245 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:19:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:01,249 INFO L225 Difference]: With dead ends: 1039 [2025-03-08 07:19:01,249 INFO L226 Difference]: Without dead ends: 912 [2025-03-08 07:19:01,250 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:19:01,251 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 2968 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2968 SdHoareTripleChecker+Valid, 1681 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:19:01,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2968 Valid, 1681 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-08 07:19:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-03-08 07:19:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8337004405286343) internal successors, (1665), 909 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states 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:19:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1665 transitions. [2025-03-08 07:19:01,273 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1665 transitions. Word has length 46 [2025-03-08 07:19:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:01,274 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1665 transitions. [2025-03-08 07:19:01,274 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:19:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1665 transitions. [2025-03-08 07:19:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 07:19:01,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:01,276 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:19:01,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:19:01,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:01,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:01,276 INFO L85 PathProgramCache]: Analyzing trace with hash -798689491, now seen corresponding path program 1 times [2025-03-08 07:19:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:01,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698853784] [2025-03-08 07:19:01,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:01,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 07:19:01,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 07:19:01,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:01,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:01,472 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:19:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:01,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698853784] [2025-03-08 07:19:01,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698853784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:01,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:01,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:19:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105891206] [2025-03-08 07:19:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:01,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:19:01,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:01,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:19:01,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:19:01,474 INFO L87 Difference]: Start difference. First operand 910 states and 1665 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:19:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:01,541 INFO L93 Difference]: Finished difference Result 918 states and 1674 transitions. [2025-03-08 07:19:01,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:19:01,542 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:19:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:01,545 INFO L225 Difference]: With dead ends: 918 [2025-03-08 07:19:01,545 INFO L226 Difference]: Without dead ends: 916 [2025-03-08 07:19:01,545 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:19:01,546 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 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:19:01,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-03-08 07:19:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2025-03-08 07:19:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8271334792122538) internal successors, (1670), 915 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states 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:19:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1670 transitions. [2025-03-08 07:19:01,561 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1670 transitions. Word has length 47 [2025-03-08 07:19:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:01,561 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1670 transitions. [2025-03-08 07:19:01,561 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:19:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1670 transitions. [2025-03-08 07:19:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:19:01,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:01,562 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:19:01,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:19:01,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:01,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash -583055145, now seen corresponding path program 1 times [2025-03-08 07:19:01,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:01,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895169396] [2025-03-08 07:19:01,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:01,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:01,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:19:01,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:19:01,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:01,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:01,615 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:19:01,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:01,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895169396] [2025-03-08 07:19:01,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895169396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:01,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:01,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:01,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029213092] [2025-03-08 07:19:01,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:01,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:01,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:01,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:01,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:01,617 INFO L87 Difference]: Start difference. First operand 916 states and 1670 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:19:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:01,640 INFO L93 Difference]: Finished difference Result 1062 states and 1891 transitions. [2025-03-08 07:19:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:01,640 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:19:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:01,644 INFO L225 Difference]: With dead ends: 1062 [2025-03-08 07:19:01,644 INFO L226 Difference]: Without dead ends: 986 [2025-03-08 07:19:01,644 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:19:01,644 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1486 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1625 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:19:01,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-03-08 07:19:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2025-03-08 07:19:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 982 states have (on average 1.8034623217922607) internal successors, (1771), 983 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states 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:19:01,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1771 transitions. [2025-03-08 07:19:01,660 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1771 transitions. Word has length 48 [2025-03-08 07:19:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:01,661 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1771 transitions. [2025-03-08 07:19:01,661 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:19:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1771 transitions. [2025-03-08 07:19:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:19:01,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:01,662 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:19:01,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:19:01,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:01,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1031000681, now seen corresponding path program 1 times [2025-03-08 07:19:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:01,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432555973] [2025-03-08 07:19:01,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:01,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:19:01,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:19:01,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:01,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:01,717 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:19:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432555973] [2025-03-08 07:19:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432555973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:01,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:01,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067570234] [2025-03-08 07:19:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:01,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:01,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:01,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:01,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:01,718 INFO L87 Difference]: Start difference. First operand 984 states and 1771 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:19:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:01,741 INFO L93 Difference]: Finished difference Result 1358 states and 2331 transitions. [2025-03-08 07:19:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:01,741 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:19:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:01,745 INFO L225 Difference]: With dead ends: 1358 [2025-03-08 07:19:01,746 INFO L226 Difference]: Without dead ends: 1159 [2025-03-08 07:19:01,746 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:19:01,746 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1484 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 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:19:01,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 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:19:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-08 07:19:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-03-08 07:19:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1155 states have (on average 1.7515151515151515) internal successors, (2023), 1156 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states 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:19:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2023 transitions. [2025-03-08 07:19:01,766 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2023 transitions. Word has length 48 [2025-03-08 07:19:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:01,766 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 2023 transitions. [2025-03-08 07:19:01,766 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:19:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2023 transitions. [2025-03-08 07:19:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:19:01,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:01,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:01,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:19:01,767 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:01,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -615824809, now seen corresponding path program 1 times [2025-03-08 07:19:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320338349] [2025-03-08 07:19:01,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:01,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:19:01,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:19:01,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:01,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:01,817 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:19:01,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:01,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320338349] [2025-03-08 07:19:01,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320338349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:01,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195363483] [2025-03-08 07:19:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:01,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:01,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:01,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:01,818 INFO L87 Difference]: Start difference. First operand 1157 states and 2023 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:19:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:01,844 INFO L93 Difference]: Finished difference Result 1853 states and 3045 transitions. [2025-03-08 07:19:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:01,845 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:19:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:01,851 INFO L225 Difference]: With dead ends: 1853 [2025-03-08 07:19:01,851 INFO L226 Difference]: Without dead ends: 1481 [2025-03-08 07:19:01,852 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:19:01,855 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1482 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1633 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:19:01,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1633 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2025-03-08 07:19:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1479. [2025-03-08 07:19:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 1.6784021665538253) internal successors, (2479), 1478 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states 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:19:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2479 transitions. [2025-03-08 07:19:01,882 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2479 transitions. Word has length 48 [2025-03-08 07:19:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:01,882 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2479 transitions. [2025-03-08 07:19:01,882 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:19:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2479 transitions. [2025-03-08 07:19:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:19:01,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:01,883 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:19:01,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:19:01,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:01,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1102543081, now seen corresponding path program 1 times [2025-03-08 07:19:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:01,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069697916] [2025-03-08 07:19:01,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:01,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:01,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:19:01,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:19:01,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:01,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:01,927 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:19:01,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:01,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069697916] [2025-03-08 07:19:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069697916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:01,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:01,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:01,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100621068] [2025-03-08 07:19:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:01,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:01,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:01,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:01,930 INFO L87 Difference]: Start difference. First operand 1479 states and 2479 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:19:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:01,965 INFO L93 Difference]: Finished difference Result 2771 states and 4329 transitions. [2025-03-08 07:19:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:01,966 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:19:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:01,972 INFO L225 Difference]: With dead ends: 2771 [2025-03-08 07:19:01,972 INFO L226 Difference]: Without dead ends: 2077 [2025-03-08 07:19:01,974 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:19:01,975 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1480 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1635 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:19:01,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-03-08 07:19:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2075. [2025-03-08 07:19:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2073 states have (on average 1.5894838398456343) internal successors, (3295), 2074 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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:19:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3295 transitions. [2025-03-08 07:19:02,015 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3295 transitions. Word has length 48 [2025-03-08 07:19:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:02,016 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3295 transitions. [2025-03-08 07:19:02,016 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:19:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3295 transitions. [2025-03-08 07:19:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 07:19:02,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:02,017 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:19:02,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:19:02,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:02,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2111785418, now seen corresponding path program 1 times [2025-03-08 07:19:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:02,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206500388] [2025-03-08 07:19:02,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:02,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 07:19:02,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 07:19:02,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:02,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:02,106 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:19:02,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:02,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206500388] [2025-03-08 07:19:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206500388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751264739] [2025-03-08 07:19:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:02,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:19:02,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:02,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:19:02,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:19:02,108 INFO L87 Difference]: Start difference. First operand 2075 states and 3295 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:19:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:06,913 INFO L93 Difference]: Finished difference Result 4330 states and 7604 transitions. [2025-03-08 07:19:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:19:06,914 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:19:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:06,930 INFO L225 Difference]: With dead ends: 4330 [2025-03-08 07:19:06,930 INFO L226 Difference]: Without dead ends: 3577 [2025-03-08 07:19:06,932 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:19:06,932 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 2353 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2353 SdHoareTripleChecker+Valid, 797 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:06,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2353 Valid, 797 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 07:19:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2025-03-08 07:19:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3577. [2025-03-08 07:19:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3575 states have (on average 1.5163636363636364) internal successors, (5421), 3576 states have internal predecessors, (5421), 0 states have call successors, (0), 0 states 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:19:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 5421 transitions. [2025-03-08 07:19:06,994 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 5421 transitions. Word has length 60 [2025-03-08 07:19:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:06,994 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 5421 transitions. [2025-03-08 07:19:06,994 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:19:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 5421 transitions. [2025-03-08 07:19:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:19:06,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:06,995 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:19:06,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:19:06,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:06,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash -492453955, now seen corresponding path program 1 times [2025-03-08 07:19:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086150555] [2025-03-08 07:19:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:07,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:19:07,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:19:07,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:07,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:07,107 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:19:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086150555] [2025-03-08 07:19:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086150555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:07,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:07,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:19:07,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337031926] [2025-03-08 07:19:07,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:07,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:19:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:07,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:19:07,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:19:07,109 INFO L87 Difference]: Start difference. First operand 3577 states and 5421 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:07,242 INFO L93 Difference]: Finished difference Result 8667 states and 12610 transitions. [2025-03-08 07:19:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:19:07,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 07:19:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:07,265 INFO L225 Difference]: With dead ends: 8667 [2025-03-08 07:19:07,266 INFO L226 Difference]: Without dead ends: 7737 [2025-03-08 07:19:07,270 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:19:07,271 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4645 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:07,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 3389 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2025-03-08 07:19:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 4689. [2025-03-08 07:19:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4687 states have (on average 1.4877320247493067) internal successors, (6973), 4688 states have internal predecessors, (6973), 0 states have call successors, (0), 0 states 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:19:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 6973 transitions. [2025-03-08 07:19:07,385 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 6973 transitions. Word has length 65 [2025-03-08 07:19:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:07,385 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 6973 transitions. [2025-03-08 07:19:07,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 6973 transitions. [2025-03-08 07:19:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:19:07,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:07,387 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:19:07,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:19:07,387 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:07,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash -940399491, now seen corresponding path program 1 times [2025-03-08 07:19:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:07,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025902266] [2025-03-08 07:19:07,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:07,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:07,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:19:07,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:19:07,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:07,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:07,481 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:19:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025902266] [2025-03-08 07:19:07,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025902266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:07,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:07,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:19:07,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624428888] [2025-03-08 07:19:07,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:07,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:19:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:07,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:19:07,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:19:07,483 INFO L87 Difference]: Start difference. First operand 4689 states and 6973 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:19:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:07,630 INFO L93 Difference]: Finished difference Result 9955 states and 14418 transitions. [2025-03-08 07:19:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:19:07,631 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:19:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:07,650 INFO L225 Difference]: With dead ends: 9955 [2025-03-08 07:19:07,650 INFO L226 Difference]: Without dead ends: 8665 [2025-03-08 07:19:07,654 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:19:07,655 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4649 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4649 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:07,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4649 Valid, 3351 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2025-03-08 07:19:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 6441. [2025-03-08 07:19:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6441 states, 6439 states have (on average 1.4618729616400061) internal successors, (9413), 6440 states have internal predecessors, (9413), 0 states have call successors, (0), 0 states 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:19:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 9413 transitions. [2025-03-08 07:19:07,840 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 9413 transitions. Word has length 65 [2025-03-08 07:19:07,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:07,840 INFO L471 AbstractCegarLoop]: Abstraction has 6441 states and 9413 transitions. [2025-03-08 07:19:07,840 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:19:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 9413 transitions. [2025-03-08 07:19:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:19:07,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:07,843 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:19:07,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:19:07,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash -525223619, now seen corresponding path program 1 times [2025-03-08 07:19:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:07,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384019100] [2025-03-08 07:19:07,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:07,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:19:07,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:19:07,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:07,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:07,940 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:19:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:07,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384019100] [2025-03-08 07:19:07,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384019100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:07,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:07,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:19:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449650020] [2025-03-08 07:19:07,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:07,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:19:07,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:07,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:19:07,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:19:07,941 INFO L87 Difference]: Start difference. First operand 6441 states and 9413 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:19:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:08,103 INFO L93 Difference]: Finished difference Result 11243 states and 16218 transitions. [2025-03-08 07:19:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:19:08,104 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:19:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:08,124 INFO L225 Difference]: With dead ends: 11243 [2025-03-08 07:19:08,124 INFO L226 Difference]: Without dead ends: 9953 [2025-03-08 07:19:08,129 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:19:08,129 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4669 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:08,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 3349 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2025-03-08 07:19:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 7729. [2025-03-08 07:19:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7729 states, 7727 states have (on average 1.451145334541219) internal successors, (11213), 7728 states have internal predecessors, (11213), 0 states have call successors, (0), 0 states 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:19:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 11213 transitions. [2025-03-08 07:19:08,284 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 11213 transitions. Word has length 65 [2025-03-08 07:19:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:08,284 INFO L471 AbstractCegarLoop]: Abstraction has 7729 states and 11213 transitions. [2025-03-08 07:19:08,285 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:19:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 11213 transitions. [2025-03-08 07:19:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:19:08,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:08,287 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:19:08,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:19:08,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:08,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1011941891, now seen corresponding path program 1 times [2025-03-08 07:19:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:08,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625106841] [2025-03-08 07:19:08,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:08,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:08,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:19:08,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:19:08,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:08,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:08,381 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:19:08,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:08,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625106841] [2025-03-08 07:19:08,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625106841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:08,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:08,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:19:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066001944] [2025-03-08 07:19:08,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:08,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:19:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:08,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:19:08,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:19:08,383 INFO L87 Difference]: Start difference. First operand 7729 states and 11213 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:19:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:08,550 INFO L93 Difference]: Finished difference Result 12531 states and 18018 transitions. [2025-03-08 07:19:08,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:19:08,550 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:19:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:08,569 INFO L225 Difference]: With dead ends: 12531 [2025-03-08 07:19:08,570 INFO L226 Difference]: Without dead ends: 11241 [2025-03-08 07:19:08,576 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:19:08,576 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 4661 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:08,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 3359 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11241 states. [2025-03-08 07:19:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11241 to 9017. [2025-03-08 07:19:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4434830837493067) internal successors, (13013), 9016 states have internal predecessors, (13013), 0 states have call successors, (0), 0 states 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:19:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 13013 transitions. [2025-03-08 07:19:08,803 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 13013 transitions. Word has length 65 [2025-03-08 07:19:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:08,804 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 13013 transitions. [2025-03-08 07:19:08,804 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:19:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 13013 transitions. [2025-03-08 07:19:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:19:08,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:08,806 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] [2025-03-08 07:19:08,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:19:08,806 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:08,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 78192369, now seen corresponding path program 1 times [2025-03-08 07:19:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288881447] [2025-03-08 07:19:08,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:08,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:08,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:19:08,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:19:08,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:08,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:08,879 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:19:08,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:08,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288881447] [2025-03-08 07:19:08,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288881447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:08,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:08,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:08,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953047520] [2025-03-08 07:19:08,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:08,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:08,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:08,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:08,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:08,882 INFO L87 Difference]: Start difference. First operand 9017 states and 13013 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:19:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:08,972 INFO L93 Difference]: Finished difference Result 15749 states and 22431 transitions. [2025-03-08 07:19:08,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:08,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 66 [2025-03-08 07:19:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:08,988 INFO L225 Difference]: With dead ends: 15749 [2025-03-08 07:19:08,988 INFO L226 Difference]: Without dead ends: 9019 [2025-03-08 07:19:08,996 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:19:08,998 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 37 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3064 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:19:08,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9019 states. [2025-03-08 07:19:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9019 to 9017. [2025-03-08 07:19:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4297282307265669) internal successors, (12889), 9016 states have internal predecessors, (12889), 0 states have call successors, (0), 0 states 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:19:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 12889 transitions. [2025-03-08 07:19:09,139 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 12889 transitions. Word has length 66 [2025-03-08 07:19:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:09,139 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 12889 transitions. [2025-03-08 07:19:09,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:19:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 12889 transitions. [2025-03-08 07:19:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:19:09,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:09,141 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:19:09,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:19:09,141 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:09,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:09,142 INFO L85 PathProgramCache]: Analyzing trace with hash -628102213, now seen corresponding path program 1 times [2025-03-08 07:19:09,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:09,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051035698] [2025-03-08 07:19:09,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:09,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:09,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:19:09,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:19:09,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:09,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:09,202 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:19:09,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:09,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051035698] [2025-03-08 07:19:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051035698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:09,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089200847] [2025-03-08 07:19:09,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:09,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:09,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:09,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:09,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:09,205 INFO L87 Difference]: Start difference. First operand 9017 states and 12889 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:19:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:09,254 INFO L93 Difference]: Finished difference Result 11590 states and 16473 transitions. [2025-03-08 07:19:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:09,254 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:19:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:09,262 INFO L225 Difference]: With dead ends: 11590 [2025-03-08 07:19:09,262 INFO L226 Difference]: Without dead ends: 4860 [2025-03-08 07:19:09,269 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:19:09,269 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 31 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3061 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:19:09,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3061 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:09,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2025-03-08 07:19:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4852. [2025-03-08 07:19:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4850 states have (on average 1.4696907216494846) internal successors, (7128), 4851 states have internal predecessors, (7128), 0 states have call successors, (0), 0 states 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:19:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 7128 transitions. [2025-03-08 07:19:09,335 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 7128 transitions. Word has length 67 [2025-03-08 07:19:09,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:09,335 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 7128 transitions. [2025-03-08 07:19:09,335 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:19:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 7128 transitions. [2025-03-08 07:19:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:19:09,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:09,336 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] [2025-03-08 07:19:09,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:19:09,337 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:09,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash 667894008, now seen corresponding path program 1 times [2025-03-08 07:19:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:09,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322773517] [2025-03-08 07:19:09,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:09,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:19:09,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:19:09,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:09,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:09,406 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:19:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322773517] [2025-03-08 07:19:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322773517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:09,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:09,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:09,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921898903] [2025-03-08 07:19:09,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:09,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:09,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:09,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:09,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:09,407 INFO L87 Difference]: Start difference. First operand 4852 states and 7128 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:19:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:09,438 INFO L93 Difference]: Finished difference Result 6132 states and 8890 transitions. [2025-03-08 07:19:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:09,438 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:19:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:09,445 INFO L225 Difference]: With dead ends: 6132 [2025-03-08 07:19:09,445 INFO L226 Difference]: Without dead ends: 3578 [2025-03-08 07:19:09,448 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:19:09,448 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 33 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3040 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:19:09,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3040 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:09,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-03-08 07:19:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3576. [2025-03-08 07:19:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3574 states have (on average 1.4958030218242866) internal successors, (5346), 3575 states have internal predecessors, (5346), 0 states have call successors, (0), 0 states 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:19:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5346 transitions. [2025-03-08 07:19:09,521 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5346 transitions. Word has length 68 [2025-03-08 07:19:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:09,521 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 5346 transitions. [2025-03-08 07:19:09,521 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:19:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5346 transitions. [2025-03-08 07:19:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 07:19:09,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:09,522 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] [2025-03-08 07:19:09,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:19:09,522 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1675746273, now seen corresponding path program 1 times [2025-03-08 07:19:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:09,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113888975] [2025-03-08 07:19:09,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:09,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 07:19:09,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 07:19:09,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:09,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:09,589 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:19:09,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:09,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113888975] [2025-03-08 07:19:09,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113888975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:09,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:09,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12858026] [2025-03-08 07:19:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:09,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:09,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:09,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:09,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:09,591 INFO L87 Difference]: Start difference. First operand 3576 states and 5346 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:19:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:09,613 INFO L93 Difference]: Finished difference Result 4218 states and 6217 transitions. [2025-03-08 07:19:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:09,614 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:19:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:09,619 INFO L225 Difference]: With dead ends: 4218 [2025-03-08 07:19:09,619 INFO L226 Difference]: Without dead ends: 2940 [2025-03-08 07:19:09,622 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:19:09,622 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 30 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3025 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:19:09,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-03-08 07:19:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2025-03-08 07:19:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.521117166212534) internal successors, (4466), 2937 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states 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:19:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4466 transitions. [2025-03-08 07:19:09,657 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4466 transitions. Word has length 70 [2025-03-08 07:19:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:09,657 INFO L471 AbstractCegarLoop]: Abstraction has 2938 states and 4466 transitions. [2025-03-08 07:19:09,657 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:19:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4466 transitions. [2025-03-08 07:19:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 07:19:09,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:09,658 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] [2025-03-08 07:19:09,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:19:09,658 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:09,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:09,659 INFO L85 PathProgramCache]: Analyzing trace with hash 642136166, now seen corresponding path program 1 times [2025-03-08 07:19:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742455106] [2025-03-08 07:19:09,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:09,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 07:19:09,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 07:19:09,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:09,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742455106] [2025-03-08 07:19:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742455106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939956815] [2025-03-08 07:19:10,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:10,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:10,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:10,610 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:19:10,611 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:19:10,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 07:19:10,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 07:19:10,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:10,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:10,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 07:19:10,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:10,966 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:19:10,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:11,215 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:19:11,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939956815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:11,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:11,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-08 07:19:11,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137971783] [2025-03-08 07:19:11,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:11,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 07:19:11,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:11,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 07:19:11,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:19:11,217 INFO L87 Difference]: Start difference. First operand 2938 states and 4466 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:19:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:13,951 INFO L93 Difference]: Finished difference Result 8183 states and 11332 transitions. [2025-03-08 07:19:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-08 07:19:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 0 states have call successors, (0), 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:19:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:13,963 INFO L225 Difference]: With dead ends: 8183 [2025-03-08 07:19:13,963 INFO L226 Difference]: Without dead ends: 7469 [2025-03-08 07:19:13,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2383 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1166, Invalid=6144, Unknown=0, NotChecked=0, Total=7310 [2025-03-08 07:19:13,969 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 18189 mSDsluCounter, 9295 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18189 SdHoareTripleChecker+Valid, 10816 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:13,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18189 Valid, 10816 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:19:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2025-03-08 07:19:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 6881. [2025-03-08 07:19:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6881 states, 6879 states have (on average 1.3871202209623492) internal successors, (9542), 6880 states have internal predecessors, (9542), 0 states have call successors, (0), 0 states 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:19:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6881 states to 6881 states and 9542 transitions. [2025-03-08 07:19:14,116 INFO L78 Accepts]: Start accepts. Automaton has 6881 states and 9542 transitions. Word has length 72 [2025-03-08 07:19:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:14,116 INFO L471 AbstractCegarLoop]: Abstraction has 6881 states and 9542 transitions. [2025-03-08 07:19:14,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:19:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6881 states and 9542 transitions. [2025-03-08 07:19:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 07:19:14,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:14,117 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] [2025-03-08 07:19:14,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 07:19:14,318 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:19:14,322 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:14,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1347160917, now seen corresponding path program 1 times [2025-03-08 07:19:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:14,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492651383] [2025-03-08 07:19:14,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:14,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:14,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 07:19:14,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 07:19:14,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:14,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:14,648 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:19:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492651383] [2025-03-08 07:19:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492651383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263247076] [2025-03-08 07:19:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:14,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:14,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:14,651 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:19:14,653 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:19:14,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 07:19:14,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 07:19:14,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:14,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:14,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:19:14,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:15,037 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:19:15,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:15,687 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:19:15,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263247076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:15,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:15,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-08 07:19:15,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991892604] [2025-03-08 07:19:15,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:15,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 07:19:15,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:15,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 07:19:15,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:19:15,689 INFO L87 Difference]: Start difference. First operand 6881 states and 9542 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:19:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:16,166 INFO L93 Difference]: Finished difference Result 15577 states and 20822 transitions. [2025-03-08 07:19:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 07:19:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-08 07:19:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:16,182 INFO L225 Difference]: With dead ends: 15577 [2025-03-08 07:19:16,183 INFO L226 Difference]: Without dead ends: 11215 [2025-03-08 07:19:16,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2025-03-08 07:19:16,186 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 14924 mSDsluCounter, 4697 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14924 SdHoareTripleChecker+Valid, 6195 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:16,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14924 Valid, 6195 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:19:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11215 states. [2025-03-08 07:19:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11215 to 11211. [2025-03-08 07:19:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11211 states, 11209 states have (on average 1.3476670532607726) internal successors, (15106), 11210 states have internal predecessors, (15106), 0 states have call successors, (0), 0 states 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:19:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11211 states to 11211 states and 15106 transitions. [2025-03-08 07:19:16,383 INFO L78 Accepts]: Start accepts. Automaton has 11211 states and 15106 transitions. Word has length 73 [2025-03-08 07:19:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:16,385 INFO L471 AbstractCegarLoop]: Abstraction has 11211 states and 15106 transitions. [2025-03-08 07:19:16,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:19:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 11211 states and 15106 transitions. [2025-03-08 07:19:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 07:19:16,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:16,386 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] [2025-03-08 07:19:16,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:19:16,591 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:19:16,591 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:16,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash 542316651, now seen corresponding path program 1 times [2025-03-08 07:19:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:16,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934423221] [2025-03-08 07:19:16,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:16,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 07:19:16,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 07:19:16,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:16,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:16,803 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:19:16,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:16,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934423221] [2025-03-08 07:19:16,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934423221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:16,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302615004] [2025-03-08 07:19:16,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:16,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:16,806 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:19:16,808 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:19:16,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 07:19:16,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 07:19:16,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:16,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:16,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 07:19:16,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:17,221 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:19:17,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:17,824 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:19:17,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302615004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:17,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:17,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-08 07:19:17,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630348684] [2025-03-08 07:19:17,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:17,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 07:19:17,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:17,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 07:19:17,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-08 07:19:17,826 INFO L87 Difference]: Start difference. First operand 11211 states and 15106 transitions. Second operand has 26 states, 26 states have (on average 7.884615384615385) internal successors, (205), 25 states have internal predecessors, (205), 0 states have call successors, (0), 0 states 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:19:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:19,417 INFO L93 Difference]: Finished difference Result 49423 states and 64684 transitions. [2025-03-08 07:19:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 07:19:19,420 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.884615384615385) internal successors, (205), 25 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-08 07:19:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:19,482 INFO L225 Difference]: With dead ends: 49423 [2025-03-08 07:19:19,482 INFO L226 Difference]: Without dead ends: 40587 [2025-03-08 07:19:19,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=662, Invalid=2530, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 07:19:19,494 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 18502 mSDsluCounter, 7912 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18502 SdHoareTripleChecker+Valid, 9409 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:19,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18502 Valid, 9409 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:19:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40587 states. [2025-03-08 07:19:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40587 to 39983. [2025-03-08 07:19:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39983 states, 39981 states have (on average 1.2731547485055401) internal successors, (50902), 39982 states have internal predecessors, (50902), 0 states have call successors, (0), 0 states 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:19:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39983 states to 39983 states and 50902 transitions. [2025-03-08 07:19:20,573 INFO L78 Accepts]: Start accepts. Automaton has 39983 states and 50902 transitions. Word has length 73 [2025-03-08 07:19:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:20,573 INFO L471 AbstractCegarLoop]: Abstraction has 39983 states and 50902 transitions. [2025-03-08 07:19:20,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.884615384615385) internal successors, (205), 25 states have internal predecessors, (205), 0 states have call successors, (0), 0 states 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:19:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 39983 states and 50902 transitions. [2025-03-08 07:19:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 07:19:20,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:20,575 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] [2025-03-08 07:19:20,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 07:19:20,779 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:19:20,779 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:20,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1204747137, now seen corresponding path program 1 times [2025-03-08 07:19:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:20,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888593461] [2025-03-08 07:19:20,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:20,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:20,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 07:19:20,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 07:19:20,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:20,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:20,979 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:19:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888593461] [2025-03-08 07:19:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888593461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409288338] [2025-03-08 07:19:20,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:20,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:20,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:20,981 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:19:20,987 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:19:21,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 07:19:21,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 07:19:21,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:21,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:21,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 07:19:21,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:21,506 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:19:21,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:22,067 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:19:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409288338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:22,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:22,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-08 07:19:22,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509725508] [2025-03-08 07:19:22,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:22,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 07:19:22,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:22,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 07:19:22,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-08 07:19:22,069 INFO L87 Difference]: Start difference. First operand 39983 states and 50902 transitions. Second operand has 23 states, 23 states have (on average 7.0) internal successors, (161), 22 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:19:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:23,146 INFO L93 Difference]: Finished difference Result 77775 states and 98721 transitions. [2025-03-08 07:19:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 07:19:23,147 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.0) internal successors, (161), 22 states have internal predecessors, (161), 0 states have call successors, (0), 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:19:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:23,205 INFO L225 Difference]: With dead ends: 77775 [2025-03-08 07:19:23,205 INFO L226 Difference]: Without dead ends: 41619 [2025-03-08 07:19:23,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 07:19:23,230 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 12371 mSDsluCounter, 3294 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12371 SdHoareTripleChecker+Valid, 4812 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:23,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12371 Valid, 4812 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:19:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41619 states. [2025-03-08 07:19:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41619 to 40527. [2025-03-08 07:19:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40527 states, 40525 states have (on average 1.2625046267735966) internal successors, (51163), 40526 states have internal predecessors, (51163), 0 states have call successors, (0), 0 states 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:19:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40527 states to 40527 states and 51163 transitions. [2025-03-08 07:19:24,474 INFO L78 Accepts]: Start accepts. Automaton has 40527 states and 51163 transitions. Word has length 74 [2025-03-08 07:19:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:24,475 INFO L471 AbstractCegarLoop]: Abstraction has 40527 states and 51163 transitions. [2025-03-08 07:19:24,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.0) internal successors, (161), 22 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:19:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 40527 states and 51163 transitions. [2025-03-08 07:19:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 07:19:24,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:24,477 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:19:24,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 07:19:24,677 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:19:24,678 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:24,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1202430224, now seen corresponding path program 1 times [2025-03-08 07:19:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477217656] [2025-03-08 07:19:24,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:24,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:24,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:19:24,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:19:24,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:24,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:25,291 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:19:25,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:25,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477217656] [2025-03-08 07:19:25,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477217656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:25,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983100469] [2025-03-08 07:19:25,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:25,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:25,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:25,293 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:19:25,294 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:19:25,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:19:25,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:19:25,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:25,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:25,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 07:19:25,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:25,887 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:19:25,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:26,348 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:19:26,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983100469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:26,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:26,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2025-03-08 07:19:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453836866] [2025-03-08 07:19:26,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:26,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 07:19:26,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:26,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 07:19:26,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2025-03-08 07:19:26,350 INFO L87 Difference]: Start difference. First operand 40527 states and 51163 transitions. Second operand has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:19:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:28,469 INFO L93 Difference]: Finished difference Result 70179 states and 88081 transitions. [2025-03-08 07:19:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 07:19:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 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:19:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:28,541 INFO L225 Difference]: With dead ends: 70179 [2025-03-08 07:19:28,541 INFO L226 Difference]: Without dead ends: 56713 [2025-03-08 07:19:28,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=1803, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 07:19:28,561 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 12646 mSDsluCounter, 18531 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12646 SdHoareTripleChecker+Valid, 20043 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:28,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12646 Valid, 20043 Invalid, 1073 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:19:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56713 states. [2025-03-08 07:19:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56713 to 37487. [2025-03-08 07:19:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37487 states, 37485 states have (on average 1.2614912631719355) internal successors, (47287), 37486 states have internal predecessors, (47287), 0 states have call successors, (0), 0 states 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:19:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37487 states to 37487 states and 47287 transitions. [2025-03-08 07:19:29,660 INFO L78 Accepts]: Start accepts. Automaton has 37487 states and 47287 transitions. Word has length 75 [2025-03-08 07:19:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:29,661 INFO L471 AbstractCegarLoop]: Abstraction has 37487 states and 47287 transitions. [2025-03-08 07:19:29,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:19:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 37487 states and 47287 transitions. [2025-03-08 07:19:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 07:19:29,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:29,662 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:19:29,669 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:19:29,863 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:19:29,863 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:29,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1881637423, now seen corresponding path program 1 times [2025-03-08 07:19:29,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:29,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58582817] [2025-03-08 07:19:29,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:29,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:19:29,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:19:29,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:29,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:30,954 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:19:30,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:30,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58582817] [2025-03-08 07:19:30,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58582817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:30,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295597673] [2025-03-08 07:19:30,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:30,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:30,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:30,959 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:19:30,960 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:19:31,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:19:31,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:19:31,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:31,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:31,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 07:19:31,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:31,617 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:19:31,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:32,355 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:19:32,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295597673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:32,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:32,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 41 [2025-03-08 07:19:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102440507] [2025-03-08 07:19:32,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:32,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 07:19:32,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:32,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 07:19:32,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 07:19:32,357 INFO L87 Difference]: Start difference. First operand 37487 states and 47287 transitions. Second operand has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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:19:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:37,977 INFO L93 Difference]: Finished difference Result 104137 states and 130904 transitions. [2025-03-08 07:19:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 07:19:37,977 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 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:19:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:38,080 INFO L225 Difference]: With dead ends: 104137 [2025-03-08 07:19:38,080 INFO L226 Difference]: Without dead ends: 90299 [2025-03-08 07:19:38,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1507, Invalid=5803, Unknown=0, NotChecked=0, Total=7310 [2025-03-08 07:19:38,099 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 21219 mSDsluCounter, 22822 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21219 SdHoareTripleChecker+Valid, 24364 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:38,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21219 Valid, 24364 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:19:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90299 states. [2025-03-08 07:19:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90299 to 34171. [2025-03-08 07:19:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34171 states, 34169 states have (on average 1.2614943369721092) internal successors, (43104), 34170 states have internal predecessors, (43104), 0 states have call successors, (0), 0 states 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:19:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34171 states to 34171 states and 43104 transitions. [2025-03-08 07:19:39,567 INFO L78 Accepts]: Start accepts. Automaton has 34171 states and 43104 transitions. Word has length 75 [2025-03-08 07:19:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:39,568 INFO L471 AbstractCegarLoop]: Abstraction has 34171 states and 43104 transitions. [2025-03-08 07:19:39,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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:19:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 34171 states and 43104 transitions. [2025-03-08 07:19:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 07:19:39,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:39,569 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:19:39,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 07:19:39,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:39,770 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:39,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash -917270960, now seen corresponding path program 1 times [2025-03-08 07:19:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:39,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799312029] [2025-03-08 07:19:39,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:39,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:39,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:19:39,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:19:39,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:39,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:40,157 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:19:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799312029] [2025-03-08 07:19:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799312029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397334258] [2025-03-08 07:19:40,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:40,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:40,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:40,160 INFO L229 MonitoredProcess]: Starting monitored process 8 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:19:40,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 07:19:40,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:19:40,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:19:40,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:40,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:40,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-08 07:19:40,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:43,319 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:19:43,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:48,061 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:19:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397334258] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:48,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:48,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 26] total 61 [2025-03-08 07:19:48,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358846968] [2025-03-08 07:19:48,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:48,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 07:19:48,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:48,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 07:19:48,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=3083, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 07:19:48,063 INFO L87 Difference]: Start difference. First operand 34171 states and 43104 transitions. Second operand has 61 states, 61 states have (on average 3.19672131147541) internal successors, (195), 61 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:20:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:20:02,625 INFO L93 Difference]: Finished difference Result 54470 states and 68343 transitions. [2025-03-08 07:20:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-08 07:20:02,625 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 3.19672131147541) internal successors, (195), 61 states have internal predecessors, (195), 0 states have call successors, (0), 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:20:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:20:02,662 INFO L225 Difference]: With dead ends: 54470 [2025-03-08 07:20:02,662 INFO L226 Difference]: Without dead ends: 38034 [2025-03-08 07:20:02,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5841 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=4762, Invalid=15544, Unknown=0, NotChecked=0, Total=20306 [2025-03-08 07:20:02,675 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 25167 mSDsluCounter, 21836 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25167 SdHoareTripleChecker+Valid, 23359 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:20:02,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25167 Valid, 23359 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 07:20:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38034 states. [2025-03-08 07:20:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38034 to 30926. [2025-03-08 07:20:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30926 states, 30924 states have (on average 1.2584077092226102) internal successors, (38915), 30925 states have internal predecessors, (38915), 0 states have call successors, (0), 0 states 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:20:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30926 states to 30926 states and 38915 transitions. [2025-03-08 07:20:03,785 INFO L78 Accepts]: Start accepts. Automaton has 30926 states and 38915 transitions. Word has length 75 [2025-03-08 07:20:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:20:03,786 INFO L471 AbstractCegarLoop]: Abstraction has 30926 states and 38915 transitions. [2025-03-08 07:20:03,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 3.19672131147541) internal successors, (195), 61 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:20:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 30926 states and 38915 transitions. [2025-03-08 07:20:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:20:03,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:20:03,787 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] [2025-03-08 07:20:03,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 07:20:03,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:20:03,988 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:20:03,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:20:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash 452899661, now seen corresponding path program 1 times [2025-03-08 07:20:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:20:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155795875] [2025-03-08 07:20:03,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:20:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:20:03,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:20:04,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:20:04,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:20:04,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:20:04,729 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:20:04,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:20:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155795875] [2025-03-08 07:20:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155795875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:20:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556320013] [2025-03-08 07:20:04,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:20:04,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:20:04,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:20:04,731 INFO L229 MonitoredProcess]: Starting monitored process 9 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:20:04,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 07:20:04,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:20:04,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:20:04,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:20:04,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:20:04,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 07:20:04,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:20:05,314 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:20:05,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:20:06,134 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:20:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556320013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:20:06,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:20:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 38 [2025-03-08 07:20:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911082806] [2025-03-08 07:20:06,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:20:06,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 07:20:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:20:06,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 07:20:06,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 07:20:06,135 INFO L87 Difference]: Start difference. First operand 30926 states and 38915 transitions. Second operand has 38 states, 38 states have (on average 5.394736842105263) internal successors, (205), 38 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)