./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f3e3e9ccc5a5069122f9a5e86045d7e13172c8034d09d1e159c68b2e816764e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:21:59,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:21:59,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:21:59,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:21:59,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:21:59,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:21:59,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:21:59,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:21:59,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:21:59,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:21:59,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:21:59,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:21:59,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:21:59,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:21:59,861 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:21:59,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:21:59,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:21:59,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:21:59,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:21:59,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:21:59,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:21:59,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:21:59,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:21:59,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:21:59,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:21:59,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:21:59,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:21:59,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:21:59,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:21:59,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:21:59,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:21:59,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:21:59,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:21:59,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:21:59,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:21:59,865 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:21:59,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:21:59,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:21:59,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:21:59,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:21:59,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:21:59,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:21:59,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:21:59,866 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 -> 5f3e3e9ccc5a5069122f9a5e86045d7e13172c8034d09d1e159c68b2e816764e [2025-03-16 20:22:00,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:22:00,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:22:00,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:22:00,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:22:00,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:22:00,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-16 20:22:01,200 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77bf5839d/30f739e3cfb94c079f1df274cd3be649/FLAG24f923e94 [2025-03-16 20:22:01,705 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:22:01,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-16 20:22:01,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77bf5839d/30f739e3cfb94c079f1df274cd3be649/FLAG24f923e94 [2025-03-16 20:22:01,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77bf5839d/30f739e3cfb94c079f1df274cd3be649 [2025-03-16 20:22:01,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:22:01,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:22:01,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:22:01,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:22:01,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:22:01,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:22:01" (1/1) ... [2025-03-16 20:22:01,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f794e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:01, skipping insertion in model container [2025-03-16 20:22:01,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:22:01" (1/1) ... [2025-03-16 20:22:01,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:22:02,088 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[6524,6537] [2025-03-16 20:22:02,138 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[13814,13827] [2025-03-16 20:22:02,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:22:02,534 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:22:02,558 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[6524,6537] [2025-03-16 20:22:02,567 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[13814,13827] [2025-03-16 20:22:02,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:22:02,824 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:22:02,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02 WrapperNode [2025-03-16 20:22:02,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:22:02,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:22:02,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:22:02,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:22:02,831 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:22:02" (1/1) ... [2025-03-16 20:22:02,878 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:22:02" (1/1) ... [2025-03-16 20:22:03,140 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4975 [2025-03-16 20:22:03,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:22:03,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:22:03,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:22:03,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:22:03,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,346 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:22:03,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:22:03,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:22:03,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:22:03,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:22:03,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (1/1) ... [2025-03-16 20:22:03,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:22:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:03,584 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:22:03,588 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:22:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:22:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:22:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:22:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:22:03,684 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:22:03,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:22:06,978 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4955: havoc calculate_output3_#t~ret31#1; [2025-03-16 20:22:06,979 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc calculate_output_#t~ret29#1; [2025-03-16 20:22:06,979 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: havoc calculate_output2_#t~ret30#1; [2025-03-16 20:22:07,127 INFO L? ?]: Removed 730 outVars from TransFormulas that were not future-live. [2025-03-16 20:22:07,128 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:22:07,155 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:22:07,155 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:22:07,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:22:07 BoogieIcfgContainer [2025-03-16 20:22:07,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:22:07,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:22:07,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:22:07,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:22:07,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:22:01" (1/3) ... [2025-03-16 20:22:07,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de7faa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:22:07, skipping insertion in model container [2025-03-16 20:22:07,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:02" (2/3) ... [2025-03-16 20:22:07,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de7faa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:22:07, skipping insertion in model container [2025-03-16 20:22:07,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:22:07" (3/3) ... [2025-03-16 20:22:07,163 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-16 20:22:07,174 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:22:07,177 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c that has 1 procedures, 807 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:22:07,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:22:07,250 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;@29efa3ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:22:07,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:22:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:22:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:22:07,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:07,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:07,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:07,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash 768302087, now seen corresponding path program 1 times [2025-03-16 20:22:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:07,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339054349] [2025-03-16 20:22:07,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:07,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:22:07,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:22:07,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:07,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339054349] [2025-03-16 20:22:07,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339054349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:07,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:07,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:22:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800982407] [2025-03-16 20:22:07,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:07,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:22:07,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:07,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:22:07,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:22:07,473 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:22:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:07,551 INFO L93 Difference]: Finished difference Result 1594 states and 3142 transitions. [2025-03-16 20:22:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:22:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:22:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:07,573 INFO L225 Difference]: With dead ends: 1594 [2025-03-16 20:22:07,575 INFO L226 Difference]: Without dead ends: 803 [2025-03-16 20:22:07,582 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:22:07,585 INFO L435 NwaCegarLoop]: 1525 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, 1525 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:22:07,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-16 20:22:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-16 20:22:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states 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:22:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2025-03-16 20:22:07,664 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2025-03-16 20:22:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:07,665 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2025-03-16 20:22:07,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:22:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2025-03-16 20:22:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:22:07,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:07,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:07,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:22:07,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 474899080, now seen corresponding path program 1 times [2025-03-16 20:22:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:07,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052144043] [2025-03-16 20:22:07,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:07,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:22:07,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:22:07,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:07,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:07,829 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:22:07,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052144043] [2025-03-16 20:22:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052144043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:07,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:22:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479682100] [2025-03-16 20:22:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:22:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:07,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:22:07,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:22:07,832 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:22:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:07,909 INFO L93 Difference]: Finished difference Result 835 states and 1570 transitions. [2025-03-16 20:22:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:22:07,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:22:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:07,913 INFO L225 Difference]: With dead ends: 835 [2025-03-16 20:22:07,915 INFO L226 Difference]: Without dead ends: 803 [2025-03-16 20:22:07,916 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:22:07,916 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 0 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4540 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:07,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4540 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-16 20:22:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-16 20:22:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states 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:22:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2025-03-16 20:22:07,937 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2025-03-16 20:22:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:07,937 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2025-03-16 20:22:07,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:22:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2025-03-16 20:22:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 20:22:07,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:07,938 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] [2025-03-16 20:22:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:22:07,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:07,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1346779243, now seen corresponding path program 1 times [2025-03-16 20:22:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430670401] [2025-03-16 20:22:07,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:07,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 20:22:07,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 20:22:07,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:07,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:08,090 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:22:08,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430670401] [2025-03-16 20:22:08,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430670401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:08,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:08,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001621448] [2025-03-16 20:22:08,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:08,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:08,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:08,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:08,092 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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:22:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:08,177 INFO L93 Difference]: Finished difference Result 977 states and 1781 transitions. [2025-03-16 20:22:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:22:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-16 20:22:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:08,182 INFO L225 Difference]: With dead ends: 977 [2025-03-16 20:22:08,182 INFO L226 Difference]: Without dead ends: 948 [2025-03-16 20:22:08,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:22:08,183 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 4611 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:08,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 1759 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-16 20:22:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 830. [2025-03-16 20:22:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8695652173913044) internal successors, (1548), 829 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1548 transitions. [2025-03-16 20:22:08,212 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1548 transitions. Word has length 32 [2025-03-16 20:22:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:08,213 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1548 transitions. [2025-03-16 20:22:08,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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:22:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1548 transitions. [2025-03-16 20:22:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:22:08,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:08,213 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] [2025-03-16 20:22:08,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:22:08,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:08,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1506878637, now seen corresponding path program 1 times [2025-03-16 20:22:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612122050] [2025-03-16 20:22:08,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:08,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:22:08,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:22:08,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:08,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:08,402 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:22:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:08,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612122050] [2025-03-16 20:22:08,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612122050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:08,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:08,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:08,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223282756] [2025-03-16 20:22:08,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:08,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:08,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:08,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:08,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:08,403 INFO L87 Difference]: Start difference. First operand 830 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:22:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:08,463 INFO L93 Difference]: Finished difference Result 888 states and 1638 transitions. [2025-03-16 20:22:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:22:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:22:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:08,466 INFO L225 Difference]: With dead ends: 888 [2025-03-16 20:22:08,466 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:22:08,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:22:08,469 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 4411 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:08,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 1584 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:22:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 830. [2025-03-16 20:22:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8683574879227054) internal successors, (1547), 829 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states 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:22:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1547 transitions. [2025-03-16 20:22:08,490 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1547 transitions. Word has length 34 [2025-03-16 20:22:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:08,490 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1547 transitions. [2025-03-16 20:22:08,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:22:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1547 transitions. [2025-03-16 20:22:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:22:08,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:08,493 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] [2025-03-16 20:22:08,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:22:08,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:08,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1505835952, now seen corresponding path program 1 times [2025-03-16 20:22:08,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:08,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109373688] [2025-03-16 20:22:08,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:08,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:08,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:22:08,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:22:08,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:08,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:08,565 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:22:08,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:08,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109373688] [2025-03-16 20:22:08,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109373688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:08,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:08,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:08,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132129424] [2025-03-16 20:22:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:08,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:08,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:08,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:08,566 INFO L87 Difference]: Start difference. First operand 830 states and 1547 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:22:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:08,591 INFO L93 Difference]: Finished difference Result 931 states and 1704 transitions. [2025-03-16 20:22:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:08,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:22:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:08,595 INFO L225 Difference]: With dead ends: 931 [2025-03-16 20:22:08,595 INFO L226 Difference]: Without dead ends: 875 [2025-03-16 20:22:08,595 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:22:08,597 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 1464 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1543 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:22:08,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1543 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-16 20:22:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2025-03-16 20:22:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8507462686567164) internal successors, (1612), 872 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states 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:22:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1612 transitions. [2025-03-16 20:22:08,615 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1612 transitions. Word has length 34 [2025-03-16 20:22:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:08,615 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1612 transitions. [2025-03-16 20:22:08,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:22:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1612 transitions. [2025-03-16 20:22:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 20:22:08,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:08,616 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] [2025-03-16 20:22:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:22:08,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:08,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -530417449, now seen corresponding path program 1 times [2025-03-16 20:22:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:08,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118542786] [2025-03-16 20:22:08,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:08,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 20:22:08,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 20:22:08,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:08,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:08,800 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:22:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118542786] [2025-03-16 20:22:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118542786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:08,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:22:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598201597] [2025-03-16 20:22:08,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:08,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:22:08,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:08,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:22:08,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:22:08,802 INFO L87 Difference]: Start difference. First operand 873 states and 1612 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:22:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:08,842 INFO L93 Difference]: Finished difference Result 879 states and 1619 transitions. [2025-03-16 20:22:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:22:08,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-16 20:22:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:08,846 INFO L225 Difference]: With dead ends: 879 [2025-03-16 20:22:08,846 INFO L226 Difference]: Without dead ends: 877 [2025-03-16 20:22:08,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:22:08,847 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 0 mSDsluCounter, 5993 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7494 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:08,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7494 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-16 20:22:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2025-03-16 20:22:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8457142857142856) internal successors, (1615), 876 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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:22:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1615 transitions. [2025-03-16 20:22:08,863 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1615 transitions. Word has length 35 [2025-03-16 20:22:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:08,863 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1615 transitions. [2025-03-16 20:22:08,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:22:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1615 transitions. [2025-03-16 20:22:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:22:08,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:08,864 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] [2025-03-16 20:22:08,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:22:08,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:08,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1988236593, now seen corresponding path program 1 times [2025-03-16 20:22:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:08,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916432810] [2025-03-16 20:22:08,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:08,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:08,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:22:08,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:22:08,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:08,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:08,896 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:22:08,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916432810] [2025-03-16 20:22:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916432810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:08,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207400365] [2025-03-16 20:22:08,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:08,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:08,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:08,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:08,898 INFO L87 Difference]: Start difference. First operand 877 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:22:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:08,917 INFO L93 Difference]: Finished difference Result 1067 states and 1899 transitions. [2025-03-16 20:22:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:08,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:22:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:08,921 INFO L225 Difference]: With dead ends: 1067 [2025-03-16 20:22:08,921 INFO L226 Difference]: Without dead ends: 964 [2025-03-16 20:22:08,921 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:22:08,922 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 1472 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1581 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:22:08,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1581 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-03-16 20:22:08,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2025-03-16 20:22:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 1.8104166666666666) internal successors, (1738), 961 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states 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:22:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1738 transitions. [2025-03-16 20:22:08,941 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1738 transitions. Word has length 36 [2025-03-16 20:22:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:08,941 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1738 transitions. [2025-03-16 20:22:08,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:22:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1738 transitions. [2025-03-16 20:22:08,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:22:08,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:08,942 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] [2025-03-16 20:22:08,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:22:08,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:08,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:08,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1756941775, now seen corresponding path program 1 times [2025-03-16 20:22:08,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:08,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933230107] [2025-03-16 20:22:08,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:08,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:08,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:22:08,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:22:08,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:08,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:08,972 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:22:08,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933230107] [2025-03-16 20:22:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933230107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:08,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:08,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816230987] [2025-03-16 20:22:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:08,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:08,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:08,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:08,973 INFO L87 Difference]: Start difference. First operand 962 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:22:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:08,995 INFO L93 Difference]: Finished difference Result 1306 states and 2240 transitions. [2025-03-16 20:22:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:08,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:22:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:08,999 INFO L225 Difference]: With dead ends: 1306 [2025-03-16 20:22:08,999 INFO L226 Difference]: Without dead ends: 1118 [2025-03-16 20:22:09,000 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:22:09,000 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1470 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1583 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:22:09,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-16 20:22:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1116. [2025-03-16 20:22:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1114 states have (on average 1.7522441651705565) internal successors, (1952), 1115 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states 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:22:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1952 transitions. [2025-03-16 20:22:09,020 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1952 transitions. Word has length 36 [2025-03-16 20:22:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:09,021 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1952 transitions. [2025-03-16 20:22:09,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:22:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1952 transitions. [2025-03-16 20:22:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:22:09,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:09,021 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] [2025-03-16 20:22:09,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:22:09,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:09,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1922054193, now seen corresponding path program 1 times [2025-03-16 20:22:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:09,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398591615] [2025-03-16 20:22:09,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:09,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:22:09,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:22:09,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:09,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:09,052 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:22:09,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:09,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398591615] [2025-03-16 20:22:09,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398591615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:09,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:09,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:09,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402058163] [2025-03-16 20:22:09,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:09,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:09,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:09,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:09,054 INFO L87 Difference]: Start difference. First operand 1116 states and 1952 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:22:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:09,080 INFO L93 Difference]: Finished difference Result 1490 states and 2501 transitions. [2025-03-16 20:22:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:09,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:22:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:09,085 INFO L225 Difference]: With dead ends: 1490 [2025-03-16 20:22:09,085 INFO L226 Difference]: Without dead ends: 1288 [2025-03-16 20:22:09,085 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:22:09,086 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1474 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1583 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:22:09,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-03-16 20:22:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2025-03-16 20:22:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1284 states have (on average 1.705607476635514) internal successors, (2190), 1285 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states 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:22:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2190 transitions. [2025-03-16 20:22:09,111 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2190 transitions. Word has length 36 [2025-03-16 20:22:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:09,111 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 2190 transitions. [2025-03-16 20:22:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:22:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2190 transitions. [2025-03-16 20:22:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:22:09,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:09,112 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] [2025-03-16 20:22:09,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:22:09,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:09,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash 512007547, now seen corresponding path program 1 times [2025-03-16 20:22:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813033308] [2025-03-16 20:22:09,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:09,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:22:09,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:22:09,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:09,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:22:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813033308] [2025-03-16 20:22:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813033308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:09,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647168190] [2025-03-16 20:22:09,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:09,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:09,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:09,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:09,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:09,228 INFO L87 Difference]: Start difference. First operand 1286 states and 2190 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:09,330 INFO L93 Difference]: Finished difference Result 2934 states and 4534 transitions. [2025-03-16 20:22:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:22:09,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 20:22:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:09,339 INFO L225 Difference]: With dead ends: 2934 [2025-03-16 20:22:09,339 INFO L226 Difference]: Without dead ends: 2424 [2025-03-16 20:22:09,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:22:09,341 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 3035 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3035 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:09,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3035 Valid, 3135 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2025-03-16 20:22:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1794. [2025-03-16 20:22:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1792 states have (on average 1.6216517857142858) internal successors, (2906), 1793 states have internal predecessors, (2906), 0 states have call successors, (0), 0 states 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:22:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2906 transitions. [2025-03-16 20:22:09,380 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2906 transitions. Word has length 50 [2025-03-16 20:22:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:09,380 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 2906 transitions. [2025-03-16 20:22:09,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2906 transitions. [2025-03-16 20:22:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:22:09,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:09,381 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] [2025-03-16 20:22:09,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:22:09,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:09,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:09,381 INFO L85 PathProgramCache]: Analyzing trace with hash -37781381, now seen corresponding path program 1 times [2025-03-16 20:22:09,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:09,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945272458] [2025-03-16 20:22:09,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:09,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:22:09,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:22:09,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:09,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:22:09,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945272458] [2025-03-16 20:22:09,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945272458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:09,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:09,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:09,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943082703] [2025-03-16 20:22:09,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:09,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:09,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:09,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:09,486 INFO L87 Difference]: Start difference. First operand 1794 states and 2906 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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:22:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:09,568 INFO L93 Difference]: Finished difference Result 3442 states and 5250 transitions. [2025-03-16 20:22:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:22:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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 50 [2025-03-16 20:22:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:09,578 INFO L225 Difference]: With dead ends: 3442 [2025-03-16 20:22:09,578 INFO L226 Difference]: Without dead ends: 2932 [2025-03-16 20:22:09,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:22:09,582 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 3039 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:09,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3139 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2025-03-16 20:22:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2558. [2025-03-16 20:22:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 1.55320813771518) internal successors, (3970), 2557 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states 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:22:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3970 transitions. [2025-03-16 20:22:09,639 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3970 transitions. Word has length 50 [2025-03-16 20:22:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:09,639 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3970 transitions. [2025-03-16 20:22:09,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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:22:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3970 transitions. [2025-03-16 20:22:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:22:09,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:09,640 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] [2025-03-16 20:22:09,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:22:09,641 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:09,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:09,641 INFO L85 PathProgramCache]: Analyzing trace with hash 578189947, now seen corresponding path program 1 times [2025-03-16 20:22:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:09,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056053861] [2025-03-16 20:22:09,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:09,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:09,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:22:09,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:22:09,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:09,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:22:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:09,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056053861] [2025-03-16 20:22:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056053861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116317631] [2025-03-16 20:22:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:09,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:09,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:09,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:09,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:09,721 INFO L87 Difference]: Start difference. First operand 2558 states and 3970 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:22:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:09,801 INFO L93 Difference]: Finished difference Result 3670 states and 5582 transitions. [2025-03-16 20:22:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:22:09,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 20:22:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:09,812 INFO L225 Difference]: With dead ends: 3670 [2025-03-16 20:22:09,812 INFO L226 Difference]: Without dead ends: 3300 [2025-03-16 20:22:09,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:22:09,814 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 3034 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:09,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3034 Valid, 3147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2025-03-16 20:22:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2926. [2025-03-16 20:22:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5383036935704515) internal successors, (4498), 2925 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states 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:22:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4498 transitions. [2025-03-16 20:22:09,877 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4498 transitions. Word has length 50 [2025-03-16 20:22:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:09,877 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4498 transitions. [2025-03-16 20:22:09,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:22:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4498 transitions. [2025-03-16 20:22:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:22:09,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:09,880 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] [2025-03-16 20:22:09,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:22:09,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:09,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1763746431, now seen corresponding path program 1 times [2025-03-16 20:22:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:09,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417514602] [2025-03-16 20:22:09,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:09,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:09,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:22:09,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:22:09,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:09,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:09,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417514602] [2025-03-16 20:22:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417514602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:09,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:09,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839270851] [2025-03-16 20:22:09,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:09,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:09,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:09,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:09,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:09,953 INFO L87 Difference]: Start difference. First operand 2926 states and 4498 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:09,994 INFO L93 Difference]: Finished difference Result 5078 states and 7536 transitions. [2025-03-16 20:22:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:09,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 20:22:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:10,003 INFO L225 Difference]: With dead ends: 5078 [2025-03-16 20:22:10,003 INFO L226 Difference]: Without dead ends: 2928 [2025-03-16 20:22:10,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:10,007 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 29 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 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:22:10,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-03-16 20:22:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2025-03-16 20:22:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5212038303693571) internal successors, (4448), 2925 states have internal predecessors, (4448), 0 states have call successors, (0), 0 states 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:22:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4448 transitions. [2025-03-16 20:22:10,061 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4448 transitions. Word has length 51 [2025-03-16 20:22:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:10,061 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4448 transitions. [2025-03-16 20:22:10,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4448 transitions. [2025-03-16 20:22:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:22:10,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:10,062 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] [2025-03-16 20:22:10,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:22:10,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:10,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1844804163, now seen corresponding path program 1 times [2025-03-16 20:22:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4548451] [2025-03-16 20:22:10,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:10,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:22:10,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:22:10,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:10,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:10,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:10,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4548451] [2025-03-16 20:22:10,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4548451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:10,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:10,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777177538] [2025-03-16 20:22:10,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:10,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:10,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:10,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:10,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:10,153 INFO L87 Difference]: Start difference. First operand 2926 states and 4448 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:22:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:10,216 INFO L93 Difference]: Finished difference Result 3772 states and 5635 transitions. [2025-03-16 20:22:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:10,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 20:22:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:10,225 INFO L225 Difference]: With dead ends: 3772 [2025-03-16 20:22:10,225 INFO L226 Difference]: Without dead ends: 1622 [2025-03-16 20:22:10,227 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:22:10,228 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 23 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3013 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:22:10,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3013 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-16 20:22:10,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1615. [2025-03-16 20:22:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.6261624302541848) internal successors, (2623), 1614 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states 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:22:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2623 transitions. [2025-03-16 20:22:10,281 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2623 transitions. Word has length 52 [2025-03-16 20:22:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:10,282 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2623 transitions. [2025-03-16 20:22:10,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:22:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2623 transitions. [2025-03-16 20:22:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:22:10,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:10,287 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] [2025-03-16 20:22:10,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:22:10,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:10,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash 120675386, now seen corresponding path program 1 times [2025-03-16 20:22:10,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:10,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141506141] [2025-03-16 20:22:10,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:10,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:22:10,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:22:10,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:10,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:10,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:10,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141506141] [2025-03-16 20:22:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141506141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:10,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:10,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698730507] [2025-03-16 20:22:10,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:10,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:10,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:10,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:10,429 INFO L87 Difference]: Start difference. First operand 1615 states and 2623 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:10,451 INFO L93 Difference]: Finished difference Result 2033 states and 3201 transitions. [2025-03-16 20:22:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:10,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 20:22:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:10,455 INFO L225 Difference]: With dead ends: 2033 [2025-03-16 20:22:10,455 INFO L226 Difference]: Without dead ends: 1203 [2025-03-16 20:22:10,459 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:22:10,460 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 25 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2992 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:22:10,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2992 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-03-16 20:22:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2025-03-16 20:22:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1199 states have (on average 1.6997497914929107) internal successors, (2038), 1200 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states 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:22:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2038 transitions. [2025-03-16 20:22:10,482 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2038 transitions. Word has length 53 [2025-03-16 20:22:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:10,482 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 2038 transitions. [2025-03-16 20:22:10,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2038 transitions. [2025-03-16 20:22:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:22:10,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:10,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] [2025-03-16 20:22:10,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:22:10,483 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:10,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash 637021683, now seen corresponding path program 1 times [2025-03-16 20:22:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41433754] [2025-03-16 20:22:10,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:10,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:22:10,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:22:10,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:10,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:11,519 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:22:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41433754] [2025-03-16 20:22:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41433754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799833493] [2025-03-16 20:22:11,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:11,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:11,522 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:22:11,524 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:22:11,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:22:11,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:22:11,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:11,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:11,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 20:22:11,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:22:11,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:22:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799833493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:11,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:11,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2025-03-16 20:22:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655477999] [2025-03-16 20:22:11,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:11,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 20:22:11,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:11,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 20:22:11,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:22:11,898 INFO L87 Difference]: Start difference. First operand 1201 states and 2038 transitions. Second operand has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:22:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:14,012 INFO L93 Difference]: Finished difference Result 3410 states and 4968 transitions. [2025-03-16 20:22:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 20:22:14,013 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:22:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:14,022 INFO L225 Difference]: With dead ends: 3410 [2025-03-16 20:22:14,022 INFO L226 Difference]: Without dead ends: 2994 [2025-03-16 20:22:14,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=701, Invalid=3081, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 20:22:14,025 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 20098 mSDsluCounter, 4719 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20098 SdHoareTripleChecker+Valid, 6210 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:14,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20098 Valid, 6210 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:22:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2025-03-16 20:22:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2848. [2025-03-16 20:22:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.4462403373155306) internal successors, (4116), 2847 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states 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:22:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 4116 transitions. [2025-03-16 20:22:14,087 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 4116 transitions. Word has length 55 [2025-03-16 20:22:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:14,088 INFO L471 AbstractCegarLoop]: Abstraction has 2848 states and 4116 transitions. [2025-03-16 20:22:14,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:22:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4116 transitions. [2025-03-16 20:22:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 20:22:14,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:14,089 INFO L218 NwaCegarLoop]: trace histogram [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:22:14,097 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:22:14,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 20:22:14,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1237352262, now seen corresponding path program 1 times [2025-03-16 20:22:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431186820] [2025-03-16 20:22:14,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:14,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:22:14,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:22:14,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:14,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:14,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:14,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431186820] [2025-03-16 20:22:14,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431186820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:14,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480280440] [2025-03-16 20:22:14,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:14,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:14,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:14,566 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:22:14,567 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:22:14,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:22:14,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:22:14,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:14,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 20:22:14,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:15,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480280440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:16,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:16,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 36 [2025-03-16 20:22:16,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915945428] [2025-03-16 20:22:16,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:16,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-16 20:22:16,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:16,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-16 20:22:16,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 20:22:16,352 INFO L87 Difference]: Start difference. First operand 2848 states and 4116 transitions. Second operand has 36 states, 36 states have (on average 4.194444444444445) internal successors, (151), 36 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:22:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:18,485 INFO L93 Difference]: Finished difference Result 6809 states and 9257 transitions. [2025-03-16 20:22:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-16 20:22:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.194444444444445) internal successors, (151), 36 states have internal predecessors, (151), 0 states have call successors, (0), 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 56 [2025-03-16 20:22:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:18,493 INFO L225 Difference]: With dead ends: 6809 [2025-03-16 20:22:18,493 INFO L226 Difference]: Without dead ends: 5033 [2025-03-16 20:22:18,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1428, Invalid=6054, Unknown=0, NotChecked=0, Total=7482 [2025-03-16 20:22:18,497 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 14257 mSDsluCounter, 16559 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14257 SdHoareTripleChecker+Valid, 18046 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:18,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14257 Valid, 18046 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:22:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2025-03-16 20:22:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 3859. [2025-03-16 20:22:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 3857 states have (on average 1.3876069484054965) internal successors, (5352), 3858 states have internal predecessors, (5352), 0 states have call successors, (0), 0 states 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:22:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 5352 transitions. [2025-03-16 20:22:18,601 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 5352 transitions. Word has length 56 [2025-03-16 20:22:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:18,601 INFO L471 AbstractCegarLoop]: Abstraction has 3859 states and 5352 transitions. [2025-03-16 20:22:18,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.194444444444445) internal successors, (151), 36 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:22:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 5352 transitions. [2025-03-16 20:22:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 20:22:18,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:18,604 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] [2025-03-16 20:22:18,612 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:22:18,809 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,SelfDestructingSolverStorable16 [2025-03-16 20:22:18,809 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:18,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:18,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1073578251, now seen corresponding path program 1 times [2025-03-16 20:22:18,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:18,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815350624] [2025-03-16 20:22:18,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:18,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:18,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:22:18,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:22:18,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:18,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:19,072 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:22:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815350624] [2025-03-16 20:22:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815350624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720751039] [2025-03-16 20:22:19,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:19,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:19,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:19,074 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:22:19,076 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:22:19,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:22:19,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:22:19,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:19,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:19,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:22:19,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:19,314 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:22:19,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:19,751 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:22:19,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720751039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:19,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:19,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:22:19,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801975386] [2025-03-16 20:22:19,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:19,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:22:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:19,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:22:19,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:22:19,752 INFO L87 Difference]: Start difference. First operand 3859 states and 5352 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:22:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:20,084 INFO L93 Difference]: Finished difference Result 9071 states and 11938 transitions. [2025-03-16 20:22:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:22:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 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 56 [2025-03-16 20:22:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:20,094 INFO L225 Difference]: With dead ends: 9071 [2025-03-16 20:22:20,094 INFO L226 Difference]: Without dead ends: 6403 [2025-03-16 20:22:20,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2025-03-16 20:22:20,105 INFO L435 NwaCegarLoop]: 1490 mSDtfsCounter, 11974 mSDsluCounter, 4651 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11974 SdHoareTripleChecker+Valid, 6141 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:20,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11974 Valid, 6141 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:22:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2025-03-16 20:22:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6399. [2025-03-16 20:22:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 6397 states have (on average 1.3293731436610912) internal successors, (8504), 6398 states have internal predecessors, (8504), 0 states have call successors, (0), 0 states 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:22:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 8504 transitions. [2025-03-16 20:22:20,344 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 8504 transitions. Word has length 56 [2025-03-16 20:22:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:20,344 INFO L471 AbstractCegarLoop]: Abstraction has 6399 states and 8504 transitions. [2025-03-16 20:22:20,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:22:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 8504 transitions. [2025-03-16 20:22:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:22:20,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:20,345 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] [2025-03-16 20:22:20,360 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:22:20,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 20:22:20,546 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:20,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash 486333277, now seen corresponding path program 1 times [2025-03-16 20:22:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021521316] [2025-03-16 20:22:20,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:20,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:22:20,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:22:20,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:20,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:20,834 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:22:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021521316] [2025-03-16 20:22:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021521316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082101225] [2025-03-16 20:22:20,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:20,836 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:22:20,838 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:22:20,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:22:20,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:22:20,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:20,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:20,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:22:20,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:21,118 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:22:21,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:21,398 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:22:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082101225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:21,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:21,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:22:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197740223] [2025-03-16 20:22:21,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:21,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:22:21,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:21,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:22:21,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:22:21,399 INFO L87 Difference]: Start difference. First operand 6399 states and 8504 transitions. Second operand has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:22:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:21,739 INFO L93 Difference]: Finished difference Result 11275 states and 14629 transitions. [2025-03-16 20:22:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:22:21,740 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 20:22:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:21,750 INFO L225 Difference]: With dead ends: 11275 [2025-03-16 20:22:21,750 INFO L226 Difference]: Without dead ends: 6403 [2025-03-16 20:22:21,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:22:21,756 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 10369 mSDsluCounter, 3202 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10369 SdHoareTripleChecker+Valid, 4699 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:21,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10369 Valid, 4699 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:22:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2025-03-16 20:22:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6399. [2025-03-16 20:22:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 6397 states have (on average 1.3159293418790057) internal successors, (8418), 6398 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states 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:22:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 8418 transitions. [2025-03-16 20:22:21,900 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 8418 transitions. Word has length 57 [2025-03-16 20:22:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:21,900 INFO L471 AbstractCegarLoop]: Abstraction has 6399 states and 8418 transitions. [2025-03-16 20:22:21,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:22:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 8418 transitions. [2025-03-16 20:22:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:22:21,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:21,901 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:21,907 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:22:22,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:22,102 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:22,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash 155340792, now seen corresponding path program 1 times [2025-03-16 20:22:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272386126] [2025-03-16 20:22:22,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:22,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:22:22,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:22:22,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:22,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:23,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272386126] [2025-03-16 20:22:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272386126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799549047] [2025-03-16 20:22:23,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:23,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:23,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:23,055 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:22:23,057 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:22:23,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:22:23,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:22:23,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:23,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:23,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:22:23,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:23,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:24,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799549047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:24,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:24,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 51 [2025-03-16 20:22:24,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116298658] [2025-03-16 20:22:24,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:24,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-16 20:22:24,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:24,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-16 20:22:24,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2333, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 20:22:24,716 INFO L87 Difference]: Start difference. First operand 6399 states and 8418 transitions. Second operand has 51 states, 51 states have (on average 3.0784313725490198) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:22:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:37,563 INFO L93 Difference]: Finished difference Result 16337 states and 20810 transitions. [2025-03-16 20:22:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-03-16 20:22:37,564 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.0784313725490198) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 20:22:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:37,591 INFO L225 Difference]: With dead ends: 16337 [2025-03-16 20:22:37,594 INFO L226 Difference]: Without dead ends: 12959 [2025-03-16 20:22:37,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6489 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=4682, Invalid=17370, Unknown=0, NotChecked=0, Total=22052 [2025-03-16 20:22:37,606 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 22630 mSDsluCounter, 23881 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22630 SdHoareTripleChecker+Valid, 25424 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:37,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22630 Valid, 25424 Invalid, 2634 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [110 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 20:22:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12959 states. [2025-03-16 20:22:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12959 to 6351. [2025-03-16 20:22:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6351 states, 6349 states have (on average 1.3146952275948969) internal successors, (8347), 6350 states have internal predecessors, (8347), 0 states have call successors, (0), 0 states 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:22:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6351 states to 6351 states and 8347 transitions. [2025-03-16 20:22:37,893 INFO L78 Accepts]: Start accepts. Automaton has 6351 states and 8347 transitions. Word has length 57 [2025-03-16 20:22:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:37,893 INFO L471 AbstractCegarLoop]: Abstraction has 6351 states and 8347 transitions. [2025-03-16 20:22:37,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.0784313725490198) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:22:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6351 states and 8347 transitions. [2025-03-16 20:22:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:22:37,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:37,894 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] [2025-03-16 20:22:37,901 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:22:38,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:38,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:38,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash -16391815, now seen corresponding path program 1 times [2025-03-16 20:22:38,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:38,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557750716] [2025-03-16 20:22:38,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:38,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:38,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:22:38,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:22:38,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:38,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:38,536 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:22:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557750716] [2025-03-16 20:22:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557750716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110283800] [2025-03-16 20:22:38,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:38,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:38,538 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:22:38,540 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:22:38,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:22:38,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:22:38,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:38,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:38,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:22:38,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:39,162 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:22:39,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:40,117 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:22:40,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110283800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:40,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:40,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-03-16 20:22:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901699626] [2025-03-16 20:22:40,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:40,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-16 20:22:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:40,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-16 20:22:40,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 20:22:40,119 INFO L87 Difference]: Start difference. First operand 6351 states and 8347 transitions. Second operand has 35 states, 35 states have (on average 3.914285714285714) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 0 states 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:22:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:41,439 INFO L93 Difference]: Finished difference Result 12335 states and 15891 transitions. [2025-03-16 20:22:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:22:41,439 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.914285714285714) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 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:22:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:41,446 INFO L225 Difference]: With dead ends: 12335 [2025-03-16 20:22:41,446 INFO L226 Difference]: Without dead ends: 8829 [2025-03-16 20:22:41,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=2676, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 20:22:41,451 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 18135 mSDsluCounter, 16218 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18135 SdHoareTripleChecker+Valid, 17709 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:41,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18135 Valid, 17709 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:22:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8829 states. [2025-03-16 20:22:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8829 to 4492. [2025-03-16 20:22:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 4490 states have (on average 1.3485523385300668) internal successors, (6055), 4491 states have internal predecessors, (6055), 0 states have call successors, (0), 0 states 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:22:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 6055 transitions. [2025-03-16 20:22:41,607 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 6055 transitions. Word has length 59 [2025-03-16 20:22:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:41,607 INFO L471 AbstractCegarLoop]: Abstraction has 4492 states and 6055 transitions. [2025-03-16 20:22:41,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.914285714285714) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 0 states 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:22:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 6055 transitions. [2025-03-16 20:22:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:22:41,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:41,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:41,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 20:22:41,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:41,811 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:41,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1197261638, now seen corresponding path program 1 times [2025-03-16 20:22:41,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:41,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113813534] [2025-03-16 20:22:41,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:41,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:22:41,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:22:41,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:41,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:41,877 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:22:41,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:41,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113813534] [2025-03-16 20:22:41,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113813534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:41,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:41,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245196165] [2025-03-16 20:22:41,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:41,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:22:41,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:41,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:22:41,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:22:41,879 INFO L87 Difference]: Start difference. First operand 4492 states and 6055 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:45,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:45,984 INFO L93 Difference]: Finished difference Result 6747 states and 10364 transitions. [2025-03-16 20:22:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:22:45,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 20:22:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:45,988 INFO L225 Difference]: With dead ends: 6747 [2025-03-16 20:22:45,988 INFO L226 Difference]: Without dead ends: 5994 [2025-03-16 20:22:45,989 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:22:45,991 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 2326 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:45,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 777 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 20:22:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2025-03-16 20:22:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5994. [2025-03-16 20:22:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5994 states, 5992 states have (on average 1.340287049399199) internal successors, (8031), 5993 states have internal predecessors, (8031), 0 states have call successors, (0), 0 states 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:22:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 8031 transitions. [2025-03-16 20:22:46,148 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 8031 transitions. Word has length 62 [2025-03-16 20:22:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:46,148 INFO L471 AbstractCegarLoop]: Abstraction has 5994 states and 8031 transitions. [2025-03-16 20:22:46,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 8031 transitions. [2025-03-16 20:22:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:22:46,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:46,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:22:46,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:22:46,150 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1179533217, now seen corresponding path program 1 times [2025-03-16 20:22:46,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389609948] [2025-03-16 20:22:46,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:46,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:46,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:22:46,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:22:46,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:46,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389609948] [2025-03-16 20:22:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389609948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128945035] [2025-03-16 20:22:46,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:46,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:46,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:46,570 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:46,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:22:46,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:22:46,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:22:46,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:46,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:46,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-16 20:22:46,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:48,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:53,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128945035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:53,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 29] total 61 [2025-03-16 20:22:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970422403] [2025-03-16 20:22:53,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:53,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-16 20:22:53,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:53,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-16 20:22:53,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3145, Unknown=0, NotChecked=0, Total=3660 [2025-03-16 20:22:53,286 INFO L87 Difference]: Start difference. First operand 5994 states and 8031 transitions. Second operand has 61 states, 61 states have (on average 4.262295081967213) internal successors, (260), 61 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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:23:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:04,330 INFO L93 Difference]: Finished difference Result 9882 states and 12854 transitions. [2025-03-16 20:23:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-16 20:23:04,331 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.262295081967213) internal successors, (260), 61 states have internal predecessors, (260), 0 states have call successors, (0), 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 93 [2025-03-16 20:23:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:04,337 INFO L225 Difference]: With dead ends: 9882 [2025-03-16 20:23:04,337 INFO L226 Difference]: Without dead ends: 7653 [2025-03-16 20:23:04,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9725 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=5461, Invalid=27119, Unknown=0, NotChecked=0, Total=32580 [2025-03-16 20:23:04,343 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 25815 mSDsluCounter, 24119 mSDsCounter, 0 mSdLazyCounter, 2824 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25815 SdHoareTripleChecker+Valid, 25693 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 2824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:04,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25815 Valid, 25693 Invalid, 3041 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [217 Valid, 2824 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 20:23:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7653 states. [2025-03-16 20:23:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7653 to 5857. [2025-03-16 20:23:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5857 states, 5855 states have (on average 1.3342442356959863) internal successors, (7812), 5856 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states 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:23:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5857 states to 5857 states and 7812 transitions. [2025-03-16 20:23:04,526 INFO L78 Accepts]: Start accepts. Automaton has 5857 states and 7812 transitions. Word has length 93 [2025-03-16 20:23:04,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:04,527 INFO L471 AbstractCegarLoop]: Abstraction has 5857 states and 7812 transitions. [2025-03-16 20:23:04,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.262295081967213) internal successors, (260), 61 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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:23:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5857 states and 7812 transitions. [2025-03-16 20:23:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 20:23:04,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:04,528 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:04,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 20:23:04,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:04,729 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:04,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:04,729 INFO L85 PathProgramCache]: Analyzing trace with hash -361294049, now seen corresponding path program 1 times [2025-03-16 20:23:04,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:04,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794569234] [2025-03-16 20:23:04,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:04,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:23:04,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:23:04,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:04,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:05,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794569234] [2025-03-16 20:23:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794569234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681030816] [2025-03-16 20:23:05,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:05,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:05,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:05,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:23:05,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:23:06,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:23:06,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:23:06,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:06,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 20:23:06,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:08,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681030816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:10,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:10,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 18] total 58 [2025-03-16 20:23:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59244295] [2025-03-16 20:23:10,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:10,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-16 20:23:10,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:10,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-16 20:23:10,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3077, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 20:23:10,212 INFO L87 Difference]: Start difference. First operand 5857 states and 7812 transitions. Second operand has 58 states, 58 states have (on average 4.5344827586206895) internal successors, (263), 58 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)