./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.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-?-8fc3dc6-m [2025-03-16 20:26:06,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:26:06,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:26:06,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:26:06,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:26:06,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:26:06,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:26:06,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:26:06,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:26:06,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:26:06,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:26:06,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:26:06,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:26:06,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:26:06,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:26:06,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:26:06,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:26:06,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:26:06,272 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-16 20:26:06,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:26:06,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:26:06,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:26:06,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:26:06,501 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:26:06,502 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-16 20:26:07,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ffe4c02/887dce4e45324092b079132791bc8ebd/FLAG52336e8c9 [2025-03-16 20:26:07,995 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:26:07,996 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-16 20:26:08,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ffe4c02/887dce4e45324092b079132791bc8ebd/FLAG52336e8c9 [2025-03-16 20:26:08,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ffe4c02/887dce4e45324092b079132791bc8ebd [2025-03-16 20:26:08,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:26:08,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:26:08,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:26:08,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:26:08,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:26:08,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:26:08" (1/1) ... [2025-03-16 20:26:08,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8d57d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:08, skipping insertion in model container [2025-03-16 20:26:08,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:26:08" (1/1) ... [2025-03-16 20:26:08,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:26:08,489 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-16 20:26:08,533 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-16 20:26:08,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:26:08,909 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:26:08,937 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-16 20:26:08,944 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-16 20:26:09,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:26:09,196 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:26:09,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09 WrapperNode [2025-03-16 20:26:09,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:26:09,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:26:09,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:26:09,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:26:09,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,574 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5031 [2025-03-16 20:26:09,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:26:09,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:26:09,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:26:09,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:26:09,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,725 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:26:09,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:26:09,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:26:09,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:26:09,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:26:09,918 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (1/1) ... [2025-03-16 20:26:09,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:26:09,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:09,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:26:09,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:26:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:26:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:26:09,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:26:09,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:26:10,041 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:26:10,043 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:26:13,330 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5024: havoc calculate_output3_#t~ret35#1; [2025-03-16 20:26:13,330 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc calculate_output_#t~ret33#1; [2025-03-16 20:26:13,330 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3534: havoc calculate_output2_#t~ret34#1; [2025-03-16 20:26:13,506 INFO L? ?]: Removed 735 outVars from TransFormulas that were not future-live. [2025-03-16 20:26:13,506 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:26:13,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:26:13,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:26:13,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:26:13 BoogieIcfgContainer [2025-03-16 20:26:13,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:26:13,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:26:13,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:26:13,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:26:13,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:26:08" (1/3) ... [2025-03-16 20:26:13,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d330c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:26:13, skipping insertion in model container [2025-03-16 20:26:13,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:26:09" (2/3) ... [2025-03-16 20:26:13,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d330c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:26:13, skipping insertion in model container [2025-03-16 20:26:13,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:26:13" (3/3) ... [2025-03-16 20:26:13,546 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:26:13,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:26:13,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 820 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:26:13,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:26:13,627 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;@317aea34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:26:13,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:26:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 820 states, 817 states have (on average 1.9755201958384332) internal successors, (1614), 819 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:26:13,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:13,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:13,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:13,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1252836054, now seen corresponding path program 1 times [2025-03-16 20:26:13,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:13,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882486479] [2025-03-16 20:26:13,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:13,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:26:13,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:26:13,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:13,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:13,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:13,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882486479] [2025-03-16 20:26:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882486479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:13,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:13,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:26:13,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977277908] [2025-03-16 20:26:13,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:13,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:26:13,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:13,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:26:13,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:26:13,834 INFO L87 Difference]: Start difference. First operand has 820 states, 817 states have (on average 1.9755201958384332) internal successors, (1614), 819 states have internal predecessors, (1614), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:13,905 INFO L93 Difference]: Finished difference Result 1613 states and 3176 transitions. [2025-03-16 20:26:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:26:13,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:26:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:13,924 INFO L225 Difference]: With dead ends: 1613 [2025-03-16 20:26:13,925 INFO L226 Difference]: Without dead ends: 816 [2025-03-16 20:26:13,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-16 20:26:13,930 INFO L435 NwaCegarLoop]: 1549 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, 1549 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:13,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-16 20:26:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-03-16 20:26:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.898034398034398) internal successors, (1545), 815 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1545 transitions. [2025-03-16 20:26:13,998 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1545 transitions. Word has length 19 [2025-03-16 20:26:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:13,999 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1545 transitions. [2025-03-16 20:26:13,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1545 transitions. [2025-03-16 20:26:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:26:14,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:14,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:14,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:26:14,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:14,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1534579433, now seen corresponding path program 1 times [2025-03-16 20:26:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:14,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149951050] [2025-03-16 20:26:14,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:14,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:14,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:26:14,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:26:14,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:14,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:14,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149951050] [2025-03-16 20:26:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149951050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:14,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:14,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:26:14,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586375457] [2025-03-16 20:26:14,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:14,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:26:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:14,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:26:14,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:26:14,179 INFO L87 Difference]: Start difference. First operand 816 states and 1545 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:14,253 INFO L93 Difference]: Finished difference Result 854 states and 1604 transitions. [2025-03-16 20:26:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:26:14,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:26:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:14,256 INFO L225 Difference]: With dead ends: 854 [2025-03-16 20:26:14,256 INFO L226 Difference]: Without dead ends: 816 [2025-03-16 20:26:14,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:26:14,257 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 0 mSDsluCounter, 3061 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4605 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:14,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4605 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-16 20:26:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-03-16 20:26:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.8697788697788698) internal successors, (1522), 815 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1522 transitions. [2025-03-16 20:26:14,277 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1522 transitions. Word has length 19 [2025-03-16 20:26:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:14,277 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1522 transitions. [2025-03-16 20:26:14,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1522 transitions. [2025-03-16 20:26:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 20:26:14,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:14,278 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] [2025-03-16 20:26:14,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:26:14,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:14,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash -215177375, now seen corresponding path program 1 times [2025-03-16 20:26:14,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:14,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463783442] [2025-03-16 20:26:14,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:14,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 20:26:14,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 20:26:14,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:14,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:14,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463783442] [2025-03-16 20:26:14,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463783442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:14,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:14,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:26:14,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859314672] [2025-03-16 20:26:14,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:14,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:26:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:14,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:26:14,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:26:14,427 INFO L87 Difference]: Start difference. First operand 816 states and 1522 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:14,578 INFO L93 Difference]: Finished difference Result 1096 states and 1970 transitions. [2025-03-16 20:26:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:26:14,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-16 20:26:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:14,585 INFO L225 Difference]: With dead ends: 1096 [2025-03-16 20:26:14,586 INFO L226 Difference]: Without dead ends: 1061 [2025-03-16 20:26:14,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:26:14,587 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 6246 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6246 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:14,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6246 Valid, 2171 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:26:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-16 20:26:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 849. [2025-03-16 20:26:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 847 states have (on average 1.859504132231405) internal successors, (1575), 848 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1575 transitions. [2025-03-16 20:26:14,618 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1575 transitions. Word has length 41 [2025-03-16 20:26:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:14,618 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1575 transitions. [2025-03-16 20:26:14,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1575 transitions. [2025-03-16 20:26:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:26:14,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:14,621 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] [2025-03-16 20:26:14,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:26:14,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:14,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:14,622 INFO L85 PathProgramCache]: Analyzing trace with hash -589844957, now seen corresponding path program 1 times [2025-03-16 20:26:14,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:14,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830172766] [2025-03-16 20:26:14,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:14,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:26:14,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:26:14,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:14,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830172766] [2025-03-16 20:26:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830172766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:14,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:14,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:26:14,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78451530] [2025-03-16 20:26:14,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:14,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:26:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:14,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:26:14,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:26:14,859 INFO L87 Difference]: Start difference. First operand 849 states and 1575 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:14,946 INFO L93 Difference]: Finished difference Result 919 states and 1685 transitions. [2025-03-16 20:26:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:26:14,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:26:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:14,949 INFO L225 Difference]: With dead ends: 919 [2025-03-16 20:26:14,949 INFO L226 Difference]: Without dead ends: 851 [2025-03-16 20:26:14,950 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-16 20:26:14,950 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 1488 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:14,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1726 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-16 20:26:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 849. [2025-03-16 20:26:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 847 states have (on average 1.858323494687131) internal successors, (1574), 848 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1574 transitions. [2025-03-16 20:26:14,970 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1574 transitions. Word has length 43 [2025-03-16 20:26:14,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:14,971 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1574 transitions. [2025-03-16 20:26:14,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1574 transitions. [2025-03-16 20:26:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:26:14,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:14,974 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] [2025-03-16 20:26:14,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:26:14,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:14,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash -590887642, now seen corresponding path program 1 times [2025-03-16 20:26:14,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:14,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831682274] [2025-03-16 20:26:14,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:14,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:14,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:26:14,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:26:14,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:14,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:15,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:15,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831682274] [2025-03-16 20:26:15,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831682274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:15,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:15,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:15,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531302719] [2025-03-16 20:26:15,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:15,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:15,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:15,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:15,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,060 INFO L87 Difference]: Start difference. First operand 849 states and 1574 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:15,084 INFO L93 Difference]: Finished difference Result 974 states and 1771 transitions. [2025-03-16 20:26:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:15,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:26:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:15,088 INFO L225 Difference]: With dead ends: 974 [2025-03-16 20:26:15,088 INFO L226 Difference]: Without dead ends: 906 [2025-03-16 20:26:15,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,090 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1472 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1572 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-16 20:26:15,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1572 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-16 20:26:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2025-03-16 20:26:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 1.8392461197339247) internal successors, (1659), 903 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1659 transitions. [2025-03-16 20:26:15,110 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1659 transitions. Word has length 43 [2025-03-16 20:26:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:15,111 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1659 transitions. [2025-03-16 20:26:15,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1659 transitions. [2025-03-16 20:26:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 20:26:15,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:15,113 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-16 20:26:15,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:26:15,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:15,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:15,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1104339423, now seen corresponding path program 1 times [2025-03-16 20:26:15,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:15,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018452948] [2025-03-16 20:26:15,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:15,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:15,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 20:26:15,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 20:26:15,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:15,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018452948] [2025-03-16 20:26:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018452948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:15,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:15,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:26:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372093263] [2025-03-16 20:26:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:15,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:26:15,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:15,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:26:15,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:26:15,303 INFO L87 Difference]: Start difference. First operand 904 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-16 20:26:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:15,324 INFO L93 Difference]: Finished difference Result 910 states and 1666 transitions. [2025-03-16 20:26:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:26:15,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-16 20:26:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:15,328 INFO L225 Difference]: With dead ends: 910 [2025-03-16 20:26:15,328 INFO L226 Difference]: Without dead ends: 908 [2025-03-16 20:26:15,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:26:15,328 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 0 mSDsluCounter, 3032 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:15,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4552 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-16 20:26:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2025-03-16 20:26:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 906 states have (on average 1.8344370860927153) internal successors, (1662), 907 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1662 transitions. [2025-03-16 20:26:15,343 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1662 transitions. Word has length 44 [2025-03-16 20:26:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:15,343 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1662 transitions. [2025-03-16 20:26:15,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-16 20:26:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1662 transitions. [2025-03-16 20:26:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:26:15,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:15,344 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] [2025-03-16 20:26:15,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:26:15,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:15,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash 937978053, now seen corresponding path program 1 times [2025-03-16 20:26:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988397891] [2025-03-16 20:26:15,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:15,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:26:15,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:26:15,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:15,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:15,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:15,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988397891] [2025-03-16 20:26:15,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988397891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:15,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:15,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:15,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937095507] [2025-03-16 20:26:15,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:15,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:15,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:15,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,379 INFO L87 Difference]: Start difference. First operand 908 states and 1662 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:15,397 INFO L93 Difference]: Finished difference Result 1046 states and 1875 transitions. [2025-03-16 20:26:15,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:15,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:26:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:15,401 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 20:26:15,401 INFO L226 Difference]: Without dead ends: 974 [2025-03-16 20:26:15,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,401 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1484 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:15,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1620 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-16 20:26:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2025-03-16 20:26:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 970 states have (on average 1.81340206185567) internal successors, (1759), 971 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1759 transitions. [2025-03-16 20:26:15,418 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1759 transitions. Word has length 45 [2025-03-16 20:26:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:15,418 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1759 transitions. [2025-03-16 20:26:15,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1759 transitions. [2025-03-16 20:26:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:26:15,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:15,419 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] [2025-03-16 20:26:15,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:26:15,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:15,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1695018693, now seen corresponding path program 1 times [2025-03-16 20:26:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911967003] [2025-03-16 20:26:15,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:15,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:26:15,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:26:15,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:15,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:15,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:15,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911967003] [2025-03-16 20:26:15,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911967003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:15,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:15,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855313070] [2025-03-16 20:26:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:15,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:15,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:15,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,458 INFO L87 Difference]: Start difference. First operand 972 states and 1759 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:15,479 INFO L93 Difference]: Finished difference Result 1326 states and 2299 transitions. [2025-03-16 20:26:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:15,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:26:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:15,483 INFO L225 Difference]: With dead ends: 1326 [2025-03-16 20:26:15,483 INFO L226 Difference]: Without dead ends: 1137 [2025-03-16 20:26:15,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,484 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:15,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1620 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-16 20:26:15,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1135. [2025-03-16 20:26:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1133 states have (on average 1.766107678729038) internal successors, (2001), 1134 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2001 transitions. [2025-03-16 20:26:15,504 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2001 transitions. Word has length 45 [2025-03-16 20:26:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:15,505 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 2001 transitions. [2025-03-16 20:26:15,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2001 transitions. [2025-03-16 20:26:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:26:15,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:15,505 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] [2025-03-16 20:26:15,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:26:15,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:15,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:15,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1145229765, now seen corresponding path program 1 times [2025-03-16 20:26:15,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:15,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319138825] [2025-03-16 20:26:15,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:15,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:15,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:26:15,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:26:15,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:15,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319138825] [2025-03-16 20:26:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319138825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:15,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:15,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242844599] [2025-03-16 20:26:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:15,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:15,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:15,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,552 INFO L87 Difference]: Start difference. First operand 1135 states and 2001 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:15,575 INFO L93 Difference]: Finished difference Result 1791 states and 2983 transitions. [2025-03-16 20:26:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:15,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:26:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:15,581 INFO L225 Difference]: With dead ends: 1791 [2025-03-16 20:26:15,582 INFO L226 Difference]: Without dead ends: 1439 [2025-03-16 20:26:15,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,585 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 1478 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:15,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1622 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-16 20:26:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1437. [2025-03-16 20:26:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1435 states have (on average 1.6982578397212544) internal successors, (2437), 1436 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2437 transitions. [2025-03-16 20:26:15,612 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2437 transitions. Word has length 45 [2025-03-16 20:26:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:15,613 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2437 transitions. [2025-03-16 20:26:15,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2437 transitions. [2025-03-16 20:26:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:26:15,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:15,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:15,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:26:15,614 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:15,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1761201093, now seen corresponding path program 1 times [2025-03-16 20:26:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:15,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929543382] [2025-03-16 20:26:15,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:15,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:26:15,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:26:15,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:15,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:15,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:15,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929543382] [2025-03-16 20:26:15,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929543382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:15,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:15,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:15,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120194616] [2025-03-16 20:26:15,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:15,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:15,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:15,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:15,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,678 INFO L87 Difference]: Start difference. First operand 1437 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:15,709 INFO L93 Difference]: Finished difference Result 2649 states and 4207 transitions. [2025-03-16 20:26:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:15,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:26:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:15,716 INFO L225 Difference]: With dead ends: 2649 [2025-03-16 20:26:15,716 INFO L226 Difference]: Without dead ends: 1995 [2025-03-16 20:26:15,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:15,720 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1482 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:15,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1626 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-03-16 20:26:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2025-03-16 20:26:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1991 states have (on average 1.6137619286790557) internal successors, (3213), 1992 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 3213 transitions. [2025-03-16 20:26:15,761 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 3213 transitions. Word has length 45 [2025-03-16 20:26:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:15,762 INFO L471 AbstractCegarLoop]: Abstraction has 1993 states and 3213 transitions. [2025-03-16 20:26:15,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 3213 transitions. [2025-03-16 20:26:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:26:15,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:15,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:15,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:26:15,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:15,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1244538414, now seen corresponding path program 1 times [2025-03-16 20:26:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316697947] [2025-03-16 20:26:15,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:15,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:26:15,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:26:15,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:15,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:15,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:15,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316697947] [2025-03-16 20:26:15,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316697947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:15,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:15,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640794803] [2025-03-16 20:26:15,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:15,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:26:15,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:15,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:26:15,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:26:15,871 INFO L87 Difference]: Start difference. First operand 1993 states and 3213 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:20,417 INFO L93 Difference]: Finished difference Result 4248 states and 7522 transitions. [2025-03-16 20:26:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:26:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 20:26:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:20,432 INFO L225 Difference]: With dead ends: 4248 [2025-03-16 20:26:20,432 INFO L226 Difference]: Without dead ends: 3495 [2025-03-16 20:26:20,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:26:20,434 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 2348 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 794 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.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:20,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 794 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 20:26:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2025-03-16 20:26:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2025-03-16 20:26:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 3493 states have (on average 1.5284855425135986) internal successors, (5339), 3494 states have internal predecessors, (5339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 5339 transitions. [2025-03-16 20:26:20,487 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 5339 transitions. Word has length 59 [2025-03-16 20:26:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:20,487 INFO L471 AbstractCegarLoop]: Abstraction has 3495 states and 5339 transitions. [2025-03-16 20:26:20,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 5339 transitions. [2025-03-16 20:26:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:26:20,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:20,489 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] [2025-03-16 20:26:20,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:26:20,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:20,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1434916046, now seen corresponding path program 1 times [2025-03-16 20:26:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:20,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45715344] [2025-03-16 20:26:20,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:20,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:26:20,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:26:20,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:20,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:26:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45715344] [2025-03-16 20:26:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45715344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:26:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579754907] [2025-03-16 20:26:20,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:20,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:26:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:20,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:26:20,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:26:20,591 INFO L87 Difference]: Start difference. First operand 3495 states and 5339 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-16 20:26:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:20,725 INFO L93 Difference]: Finished difference Result 8257 states and 12200 transitions. [2025-03-16 20:26:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:26:20,726 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 61 [2025-03-16 20:26:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:20,745 INFO L225 Difference]: With dead ends: 8257 [2025-03-16 20:26:20,745 INFO L226 Difference]: Without dead ends: 7391 [2025-03-16 20:26:20,749 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-16 20:26:20,750 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4635 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:20,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 3309 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2025-03-16 20:26:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 4535. [2025-03-16 20:26:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 4533 states have (on average 1.5043017868960953) internal successors, (6819), 4534 states have internal predecessors, (6819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6819 transitions. [2025-03-16 20:26:20,894 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6819 transitions. Word has length 61 [2025-03-16 20:26:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:20,898 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6819 transitions. [2025-03-16 20:26:20,898 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-16 20:26:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6819 transitions. [2025-03-16 20:26:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:26:20,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:20,899 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] [2025-03-16 20:26:20,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:26:20,899 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:20,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash -677875406, now seen corresponding path program 1 times [2025-03-16 20:26:20,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:20,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144600218] [2025-03-16 20:26:20,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:20,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:26:20,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:26:20,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:20,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:26:21,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:21,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144600218] [2025-03-16 20:26:21,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144600218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:21,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:21,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:26:21,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974858678] [2025-03-16 20:26:21,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:21,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:26:21,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:21,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:26:21,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:26:21,087 INFO L87 Difference]: Start difference. First operand 4535 states and 6819 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:21,232 INFO L93 Difference]: Finished difference Result 9465 states and 13928 transitions. [2025-03-16 20:26:21,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:26:21,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 61 [2025-03-16 20:26:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:21,258 INFO L225 Difference]: With dead ends: 9465 [2025-03-16 20:26:21,258 INFO L226 Difference]: Without dead ends: 8255 [2025-03-16 20:26:21,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:26:21,263 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4670 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4670 SdHoareTripleChecker+Valid, 3326 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:21,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4670 Valid, 3326 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8255 states. [2025-03-16 20:26:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8255 to 6175. [2025-03-16 20:26:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6175 states, 6173 states have (on average 1.4817754738376803) internal successors, (9147), 6174 states have internal predecessors, (9147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6175 states to 6175 states and 9147 transitions. [2025-03-16 20:26:21,396 INFO L78 Accepts]: Start accepts. Automaton has 6175 states and 9147 transitions. Word has length 61 [2025-03-16 20:26:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:21,396 INFO L471 AbstractCegarLoop]: Abstraction has 6175 states and 9147 transitions. [2025-03-16 20:26:21,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6175 states and 9147 transitions. [2025-03-16 20:26:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:26:21,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:21,398 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] [2025-03-16 20:26:21,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:26:21,398 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1227664334, now seen corresponding path program 1 times [2025-03-16 20:26:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153027247] [2025-03-16 20:26:21,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:21,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:26:21,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:26:21,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:21,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:26:21,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:21,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153027247] [2025-03-16 20:26:21,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153027247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:21,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:21,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:26:21,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939565828] [2025-03-16 20:26:21,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:21,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:26:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:21,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:26:21,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:26:21,509 INFO L87 Difference]: Start difference. First operand 6175 states and 9147 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:21,654 INFO L93 Difference]: Finished difference Result 10673 states and 15648 transitions. [2025-03-16 20:26:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:26:21,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:26:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:21,668 INFO L225 Difference]: With dead ends: 10673 [2025-03-16 20:26:21,668 INFO L226 Difference]: Without dead ends: 9463 [2025-03-16 20:26:21,672 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-16 20:26:21,672 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4667 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:21,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3328 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9463 states. [2025-03-16 20:26:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9463 to 7383. [2025-03-16 20:26:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7383 states, 7381 states have (on average 1.4722937271372443) internal successors, (10867), 7382 states have internal predecessors, (10867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 10867 transitions. [2025-03-16 20:26:21,799 INFO L78 Accepts]: Start accepts. Automaton has 7383 states and 10867 transitions. Word has length 61 [2025-03-16 20:26:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:21,799 INFO L471 AbstractCegarLoop]: Abstraction has 7383 states and 10867 transitions. [2025-03-16 20:26:21,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 7383 states and 10867 transitions. [2025-03-16 20:26:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:26:21,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:21,801 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] [2025-03-16 20:26:21,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:26:21,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:21,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:21,801 INFO L85 PathProgramCache]: Analyzing trace with hash -611693006, now seen corresponding path program 1 times [2025-03-16 20:26:21,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:21,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755043203] [2025-03-16 20:26:21,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:21,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:26:21,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:26:21,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:21,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:26:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755043203] [2025-03-16 20:26:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755043203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:21,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:26:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217866732] [2025-03-16 20:26:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:21,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:26:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:21,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:26:21,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:26:21,909 INFO L87 Difference]: Start difference. First operand 7383 states and 10867 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-16 20:26:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:22,068 INFO L93 Difference]: Finished difference Result 11881 states and 17368 transitions. [2025-03-16 20:26:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:26:22,069 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 61 [2025-03-16 20:26:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:22,084 INFO L225 Difference]: With dead ends: 11881 [2025-03-16 20:26:22,084 INFO L226 Difference]: Without dead ends: 10671 [2025-03-16 20:26:22,089 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-16 20:26:22,090 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 4637 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:22,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4637 Valid, 3362 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10671 states. [2025-03-16 20:26:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10671 to 8591. [2025-03-16 20:26:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8591 states, 8589 states have (on average 1.4654791011759227) internal successors, (12587), 8590 states have internal predecessors, (12587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12587 transitions. [2025-03-16 20:26:22,293 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12587 transitions. Word has length 61 [2025-03-16 20:26:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:22,294 INFO L471 AbstractCegarLoop]: Abstraction has 8591 states and 12587 transitions. [2025-03-16 20:26:22,294 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-16 20:26:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12587 transitions. [2025-03-16 20:26:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:26:22,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:22,296 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] [2025-03-16 20:26:22,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:26:22,296 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:22,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 31261546, now seen corresponding path program 1 times [2025-03-16 20:26:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:22,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487983078] [2025-03-16 20:26:22,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:22,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:26:22,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:26:22,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:22,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:22,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:22,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487983078] [2025-03-16 20:26:22,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487983078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:22,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:22,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368831172] [2025-03-16 20:26:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:22,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:22,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:22,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:22,392 INFO L87 Difference]: Start difference. First operand 8591 states and 12587 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:22,550 INFO L93 Difference]: Finished difference Result 14899 states and 21581 transitions. [2025-03-16 20:26:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:22,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 20:26:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:22,565 INFO L225 Difference]: With dead ends: 14899 [2025-03-16 20:26:22,565 INFO L226 Difference]: Without dead ends: 8593 [2025-03-16 20:26:22,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:22,574 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 37 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:22,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8593 states. [2025-03-16 20:26:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8593 to 8591. [2025-03-16 20:26:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8591 states, 8589 states have (on average 1.4510420305041332) internal successors, (12463), 8590 states have internal predecessors, (12463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12463 transitions. [2025-03-16 20:26:22,733 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12463 transitions. Word has length 62 [2025-03-16 20:26:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:22,733 INFO L471 AbstractCegarLoop]: Abstraction has 8591 states and 12463 transitions. [2025-03-16 20:26:22,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12463 transitions. [2025-03-16 20:26:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:26:22,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:22,734 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] [2025-03-16 20:26:22,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:26:22,734 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:22,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash 610722996, now seen corresponding path program 1 times [2025-03-16 20:26:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:22,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520683252] [2025-03-16 20:26:22,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:22,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:26:22,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:26:22,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:22,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:22,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520683252] [2025-03-16 20:26:22,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520683252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:22,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:22,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843397823] [2025-03-16 20:26:22,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:22,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:22,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:22,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:22,790 INFO L87 Difference]: Start difference. First operand 8591 states and 12463 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:22,836 INFO L93 Difference]: Finished difference Result 10987 states and 15870 transitions. [2025-03-16 20:26:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:22,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 20:26:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:22,845 INFO L225 Difference]: With dead ends: 10987 [2025-03-16 20:26:22,845 INFO L226 Difference]: Without dead ends: 4681 [2025-03-16 20:26:22,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:22,851 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 31 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:22,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3055 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2025-03-16 20:26:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 4674. [2025-03-16 20:26:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 4672 states have (on average 1.487585616438356) internal successors, (6950), 4673 states have internal predecessors, (6950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 6950 transitions. [2025-03-16 20:26:22,908 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 6950 transitions. Word has length 63 [2025-03-16 20:26:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:22,908 INFO L471 AbstractCegarLoop]: Abstraction has 4674 states and 6950 transitions. [2025-03-16 20:26:22,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 6950 transitions. [2025-03-16 20:26:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:26:22,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:22,908 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] [2025-03-16 20:26:22,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:26:22,909 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:22,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash 106290851, now seen corresponding path program 1 times [2025-03-16 20:26:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:22,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063736495] [2025-03-16 20:26:22,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:22,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:26:22,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:26:22,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:22,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:22,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063736495] [2025-03-16 20:26:22,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063736495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:22,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:22,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634842426] [2025-03-16 20:26:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:22,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:22,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:22,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:22,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:22,994 INFO L87 Difference]: Start difference. First operand 4674 states and 6950 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:23,021 INFO L93 Difference]: Finished difference Result 5866 states and 8624 transitions. [2025-03-16 20:26:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:23,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 64 [2025-03-16 20:26:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:23,026 INFO L225 Difference]: With dead ends: 5866 [2025-03-16 20:26:23,026 INFO L226 Difference]: Without dead ends: 3488 [2025-03-16 20:26:23,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:23,029 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 33 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:23,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3034 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2025-03-16 20:26:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3486. [2025-03-16 20:26:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 3484 states have (on average 1.5086107921928817) internal successors, (5256), 3485 states have internal predecessors, (5256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5256 transitions. [2025-03-16 20:26:23,073 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5256 transitions. Word has length 64 [2025-03-16 20:26:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:23,073 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 5256 transitions. [2025-03-16 20:26:23,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5256 transitions. [2025-03-16 20:26:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:26:23,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:23,074 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] [2025-03-16 20:26:23,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:26:23,074 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:23,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1930173660, now seen corresponding path program 1 times [2025-03-16 20:26:23,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:23,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997530436] [2025-03-16 20:26:23,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:23,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:23,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:26:23,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:26:23,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:23,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:23,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:23,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997530436] [2025-03-16 20:26:23,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997530436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:26:23,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:26:23,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:26:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805593638] [2025-03-16 20:26:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:26:23,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:26:23,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:23,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:26:23,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:23,128 INFO L87 Difference]: Start difference. First operand 3486 states and 5256 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-16 20:26:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:23,149 INFO L93 Difference]: Finished difference Result 4084 states and 6083 transitions. [2025-03-16 20:26:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:26:23,149 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-16 20:26:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:23,153 INFO L225 Difference]: With dead ends: 4084 [2025-03-16 20:26:23,153 INFO L226 Difference]: Without dead ends: 2894 [2025-03-16 20:26:23,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:26:23,155 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 30 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:23,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:26:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2025-03-16 20:26:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2892. [2025-03-16 20:26:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2890 states have (on average 1.5294117647058822) internal successors, (4420), 2891 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 4420 transitions. [2025-03-16 20:26:23,181 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 4420 transitions. Word has length 66 [2025-03-16 20:26:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:23,182 INFO L471 AbstractCegarLoop]: Abstraction has 2892 states and 4420 transitions. [2025-03-16 20:26:23,182 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-16 20:26:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 4420 transitions. [2025-03-16 20:26:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:26:23,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:23,182 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] [2025-03-16 20:26:23,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:26:23,183 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:23,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:23,183 INFO L85 PathProgramCache]: Analyzing trace with hash 103108117, now seen corresponding path program 1 times [2025-03-16 20:26:23,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:23,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211775702] [2025-03-16 20:26:23,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:23,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:23,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:26:23,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:26:23,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:23,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211775702] [2025-03-16 20:26:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211775702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:26:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325998643] [2025-03-16 20:26:24,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:24,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:26:24,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:24,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:26:24,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:26:24,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:26:24,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:26:24,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:24,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:24,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:26:24,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:26:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:24,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:24,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325998643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:24,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:24,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:26:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641937168] [2025-03-16 20:26:24,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:24,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:26:24,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:24,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:26:24,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:26:24,934 INFO L87 Difference]: Start difference. First operand 2892 states and 4420 transitions. Second operand has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:27,947 INFO L93 Difference]: Finished difference Result 8414 states and 11812 transitions. [2025-03-16 20:26:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:26:27,947 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 states have internal predecessors, (194), 0 states have call successors, (0), 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-16 20:26:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:27,958 INFO L225 Difference]: With dead ends: 8414 [2025-03-16 20:26:27,958 INFO L226 Difference]: Without dead ends: 7744 [2025-03-16 20:26:27,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2794 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1348, Invalid=7024, Unknown=0, NotChecked=0, Total=8372 [2025-03-16 20:26:27,962 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 19802 mSDsluCounter, 7857 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19802 SdHoareTripleChecker+Valid, 9365 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:27,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19802 Valid, 9365 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 20:26:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7744 states. [2025-03-16 20:26:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7744 to 7220. [2025-03-16 20:26:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7220 states, 7218 states have (on average 1.397617068440011) internal successors, (10088), 7219 states have internal predecessors, (10088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 10088 transitions. [2025-03-16 20:26:28,087 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 10088 transitions. Word has length 68 [2025-03-16 20:26:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:28,087 INFO L471 AbstractCegarLoop]: Abstraction has 7220 states and 10088 transitions. [2025-03-16 20:26:28,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 10088 transitions. [2025-03-16 20:26:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 20:26:28,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:28,088 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:26:28,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:26:28,289 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-16 20:26:28,290 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:28,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash -263141404, now seen corresponding path program 1 times [2025-03-16 20:26:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:28,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503069020] [2025-03-16 20:26:28,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:28,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:28,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:26:28,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:26:28,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:28,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:28,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:28,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503069020] [2025-03-16 20:26:28,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503069020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:26:28,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235395017] [2025-03-16 20:26:28,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:28,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:26:28,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:28,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:26:28,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:26:28,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:26:28,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:26:28,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:28,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:28,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:26:28,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:26:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:29,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235395017] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:30,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:30,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 31 [2025-03-16 20:26:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133517964] [2025-03-16 20:26:30,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:30,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 20:26:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:30,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 20:26:30,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:26:30,552 INFO L87 Difference]: Start difference. First operand 7220 states and 10088 transitions. Second operand has 31 states, 31 states have (on average 5.903225806451613) internal successors, (183), 31 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:31,637 INFO L93 Difference]: Finished difference Result 22173 states and 29843 transitions. [2025-03-16 20:26:31,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 20:26:31,638 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.903225806451613) internal successors, (183), 31 states have internal predecessors, (183), 0 states have call successors, (0), 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 69 [2025-03-16 20:26:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:31,661 INFO L225 Difference]: With dead ends: 22173 [2025-03-16 20:26:31,661 INFO L226 Difference]: Without dead ends: 17528 [2025-03-16 20:26:31,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=758, Invalid=2434, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 20:26:31,666 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 7253 mSDsluCounter, 7837 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7253 SdHoareTripleChecker+Valid, 9332 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:31,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7253 Valid, 9332 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:26:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17528 states. [2025-03-16 20:26:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17528 to 16894. [2025-03-16 20:26:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16894 states, 16892 states have (on average 1.329978688136396) internal successors, (22466), 16893 states have internal predecessors, (22466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16894 states to 16894 states and 22466 transitions. [2025-03-16 20:26:32,066 INFO L78 Accepts]: Start accepts. Automaton has 16894 states and 22466 transitions. Word has length 69 [2025-03-16 20:26:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:32,066 INFO L471 AbstractCegarLoop]: Abstraction has 16894 states and 22466 transitions. [2025-03-16 20:26:32,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.903225806451613) internal successors, (183), 31 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 16894 states and 22466 transitions. [2025-03-16 20:26:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 20:26:32,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:32,067 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:26:32,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 20:26:32,272 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-16 20:26:32,272 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:32,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash -489439836, now seen corresponding path program 1 times [2025-03-16 20:26:32,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:32,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256409597] [2025-03-16 20:26:32,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:32,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:26:32,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:26:32,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:32,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:33,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:33,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256409597] [2025-03-16 20:26:33,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256409597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:26:33,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810893819] [2025-03-16 20:26:33,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:33,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:26:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:33,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:26:33,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:26:33,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:26:33,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:26:33,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:33,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:33,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:26:33,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:26:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:33,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810893819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:34,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 34 [2025-03-16 20:26:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075452799] [2025-03-16 20:26:34,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:34,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-16 20:26:34,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:34,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-16 20:26:34,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 20:26:34,289 INFO L87 Difference]: Start difference. First operand 16894 states and 22466 transitions. Second operand has 34 states, 34 states have (on average 5.411764705882353) internal successors, (184), 34 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:36,668 INFO L93 Difference]: Finished difference Result 48510 states and 63376 transitions. [2025-03-16 20:26:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-16 20:26:36,669 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.411764705882353) internal successors, (184), 34 states have internal predecessors, (184), 0 states have call successors, (0), 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 69 [2025-03-16 20:26:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:36,712 INFO L225 Difference]: With dead ends: 48510 [2025-03-16 20:26:36,712 INFO L226 Difference]: Without dead ends: 35392 [2025-03-16 20:26:36,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=959, Invalid=4297, Unknown=0, NotChecked=0, Total=5256 [2025-03-16 20:26:36,728 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 17396 mSDsluCounter, 6798 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17396 SdHoareTripleChecker+Valid, 8308 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:36,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17396 Valid, 8308 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:26:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35392 states. [2025-03-16 20:26:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35392 to 32188. [2025-03-16 20:26:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32188 states, 32186 states have (on average 1.2952215248865966) internal successors, (41688), 32187 states have internal predecessors, (41688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32188 states to 32188 states and 41688 transitions. [2025-03-16 20:26:37,657 INFO L78 Accepts]: Start accepts. Automaton has 32188 states and 41688 transitions. Word has length 69 [2025-03-16 20:26:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:37,658 INFO L471 AbstractCegarLoop]: Abstraction has 32188 states and 41688 transitions. [2025-03-16 20:26:37,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.411764705882353) internal successors, (184), 34 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 32188 states and 41688 transitions. [2025-03-16 20:26:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:26:37,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:37,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:37,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:26:37,860 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-16 20:26:37,861 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:37,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:37,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1906622144, now seen corresponding path program 1 times [2025-03-16 20:26:37,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:37,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696784252] [2025-03-16 20:26:37,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:37,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:26:37,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:26:37,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:37,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696784252] [2025-03-16 20:26:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696784252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:26:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145371108] [2025-03-16 20:26:38,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:38,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:26:38,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:38,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:26:38,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:26:38,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:26:38,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:26:38,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:38,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:38,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:26:38,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:26:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:38,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145371108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:39,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-03-16 20:26:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026246079] [2025-03-16 20:26:39,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:39,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 20:26:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:39,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 20:26:39,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:26:39,247 INFO L87 Difference]: Start difference. First operand 32188 states and 41688 transitions. Second operand has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:40,308 INFO L93 Difference]: Finished difference Result 63110 states and 81352 transitions. [2025-03-16 20:26:40,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 20:26:40,308 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 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-16 20:26:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:40,348 INFO L225 Difference]: With dead ends: 63110 [2025-03-16 20:26:40,348 INFO L226 Difference]: Without dead ends: 33500 [2025-03-16 20:26:40,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 20:26:40,370 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 15007 mSDsluCounter, 6283 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15007 SdHoareTripleChecker+Valid, 7780 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:40,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15007 Valid, 7780 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:26:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33500 states. [2025-03-16 20:26:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33500 to 28588. [2025-03-16 20:26:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28588 states, 28586 states have (on average 1.2893374379066675) internal successors, (36857), 28587 states have internal predecessors, (36857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28588 states to 28588 states and 36857 transitions. [2025-03-16 20:26:41,482 INFO L78 Accepts]: Start accepts. Automaton has 28588 states and 36857 transitions. Word has length 70 [2025-03-16 20:26:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:41,482 INFO L471 AbstractCegarLoop]: Abstraction has 28588 states and 36857 transitions. [2025-03-16 20:26:41,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 28588 states and 36857 transitions. [2025-03-16 20:26:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:26:41,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:41,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:41,489 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-16 20:26:41,683 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-16 20:26:41,684 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:41,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash -442116934, now seen corresponding path program 1 times [2025-03-16 20:26:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333254317] [2025-03-16 20:26:41,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:41,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:26:41,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:26:41,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:41,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:41,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:41,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333254317] [2025-03-16 20:26:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333254317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:26:41,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076873043] [2025-03-16 20:26:41,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:41,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:26:41,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:41,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:26:41,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:26:41,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:26:42,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:26:42,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:42,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:42,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:26:42,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:26:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:42,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076873043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:43,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 29 [2025-03-16 20:26:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366833898] [2025-03-16 20:26:43,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:43,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 20:26:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:43,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 20:26:43,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:26:43,005 INFO L87 Difference]: Start difference. First operand 28588 states and 36857 transitions. Second operand has 29 states, 29 states have (on average 6.241379310344827) internal successors, (181), 29 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:44,489 INFO L93 Difference]: Finished difference Result 80056 states and 101940 transitions. [2025-03-16 20:26:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 20:26:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.241379310344827) internal successors, (181), 29 states have internal predecessors, (181), 0 states have call successors, (0), 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-16 20:26:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:44,643 INFO L225 Difference]: With dead ends: 80056 [2025-03-16 20:26:44,643 INFO L226 Difference]: Without dead ends: 54656 [2025-03-16 20:26:44,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1297, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 20:26:44,657 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 4894 mSDsluCounter, 7832 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4894 SdHoareTripleChecker+Valid, 9332 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:44,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4894 Valid, 9332 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:26:44,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54656 states. [2025-03-16 20:26:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54656 to 54652. [2025-03-16 20:26:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54652 states, 54650 states have (on average 1.2701189387008234) internal successors, (69412), 54651 states have internal predecessors, (69412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54652 states to 54652 states and 69412 transitions. [2025-03-16 20:26:46,502 INFO L78 Accepts]: Start accepts. Automaton has 54652 states and 69412 transitions. Word has length 70 [2025-03-16 20:26:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:46,502 INFO L471 AbstractCegarLoop]: Abstraction has 54652 states and 69412 transitions. [2025-03-16 20:26:46,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.241379310344827) internal successors, (181), 29 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 54652 states and 69412 transitions. [2025-03-16 20:26:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:26:46,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:46,504 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:26:46,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:26:46,704 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-16 20:26:46,705 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:46,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash 820241630, now seen corresponding path program 1 times [2025-03-16 20:26:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853004779] [2025-03-16 20:26:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:46,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:26:46,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:26:46,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:46,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:47,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:47,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853004779] [2025-03-16 20:26:47,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853004779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:26:47,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780022444] [2025-03-16 20:26:47,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:47,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:26:47,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:47,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:26:47,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:26:47,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:26:47,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:26:47,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:47,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:47,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-16 20:26:47,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:26:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:50,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780022444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:53,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:53,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 24, 23] total 53 [2025-03-16 20:26:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742970425] [2025-03-16 20:26:53,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:53,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 20:26:53,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:53,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 20:26:53,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2396, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 20:26:53,590 INFO L87 Difference]: Start difference. First operand 54652 states and 69412 transitions. Second operand has 53 states, 53 states have (on average 3.7358490566037736) internal successors, (198), 53 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:31,807 INFO L93 Difference]: Finished difference Result 137377 states and 173950 transitions. [2025-03-16 20:27:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2025-03-16 20:27:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.7358490566037736) internal successors, (198), 53 states have internal predecessors, (198), 0 states have call successors, (0), 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 71 [2025-03-16 20:27:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:31,942 INFO L225 Difference]: With dead ends: 137377 [2025-03-16 20:27:31,942 INFO L226 Difference]: Without dead ends: 115051 [2025-03-16 20:27:31,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17066 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=8195, Invalid=35277, Unknown=0, NotChecked=0, Total=43472 [2025-03-16 20:27:31,970 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 21721 mSDsluCounter, 18736 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21721 SdHoareTripleChecker+Valid, 20250 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:31,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21721 Valid, 20250 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 20:27:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115051 states.